hypohamiltonian graph
(Q3115577)
graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian
graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian
Language:
Current Data About
hypohamiltonian graph
other details
| description | graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian |
External Links
| (P646) |
/m/04cxyyp
|
| (P2812) |
HypohamiltonianGraph
|
| (P6366) |
2777892613
|
| (P7726) |
Hypohamiltonian
|