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-graphs
Search options answers only
not deleted
user 17798
A Hamiltonian graph (directed or undirected) is a graph that contains a Hamiltonian cycle, that is, a cycle that visits every vertex exactly once.
4
votes
A counterexample to a conjecture of Nash-Williams about hamiltonicity of digraphs?
I realize this question was asked seven years ago and hasn't had a comment in four years, but I just came across it and thought it might be worth sharing what I've learned.
As @HughThomas mentions, si …
- 1,701
4
votes
Accepted
Infinitely many counterexamples to Nash-Williams's conjecture about hamiltonicity?
These examples are symmetric digraphs, i.e. graphs. For graphs, the Nash-Williams conjecture just becomes Chvatal's theorem (If $G$ is a graph on $n\geq 3$ vertices with degree sequence $d_1\leq d_2\ …
- 1,701