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 46140
paths on a graph that visit each vertex exactly once
3
votes
Accepted
Hamiltonian path in total graph
The edges incident to $v \in V$ form a clique in $T(G)$, so the Hamiltonian path $v_1, v_2, v_3, \ldots, v_n$ in $G$ can be lifted into a Hamiltonian path in $T(G)$ as follows:
Insert the edges to ge …
- 7,226
3
votes
Accepted
Path of length $n$ but no Hamilton cycle
Assuming you mean a graph with a Hamiltonian path but no Hamiltonian cycle,
The Petersen graph is a standard example.
Any pendant-free graph with a Hamiltonian path and a bridge is an easy example; e …
- 7,226
3
votes
Accepted
How to construct a hamilton-connected cubic graph? Is it possible?
Take a cycle of $2m$ elements, label the vertices around the cycle from $0$ to $2m-1$, and add diagonals $1 \to (2m-1)$, $2 \to (2m-2)$, $\cdots$, $(m-1) \to (m+1)$, and special case $0 \to m$.
By sym …
- 7,226