Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with hamiltonian-paths
Search options not deleted
user 37432
paths on a graph that visit each vertex exactly once
4
votes
Accepted
Existence of a 2-labelled Hamiltonian Path decomposition of $K_{2n}$
I think I have a proof that such a labelling cannot exist if $n$ is even.
Suppose we have a labelling $\ell : V(K_m) \to \{ a, b \}$ and a decomposition of $K_{m}$ into a family $\mathcal{P}$ of Hami …
- 1,169
4
votes
Accepted
Sub-circle-free Christmas-gift-giving
Everybody sits down. The host initiates the exchange of gifts. He stands up and chooses one of the $(n-1)$ others to give his gift to. The person that received the gift stands up and gives his gift to …
- 1,169