hypohamiltonian graph (Q3115577)
Jump to navigation
Jump to search
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 | Label | Description | Also known as |
|---|---|---|---|
| English | hypohamiltonian graph |
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 |
Statements
Identifiers
Sitelinks
Wikipedia(6 entries)
- dewiki Hypohamiltonscher Graph
- enwiki Hypohamiltonian graph
- frwiki Graphe hypohamiltonien
- huwiki Hipohamiltoni gráf
- ruwiki Гипогамильтонов граф
- slwiki Hipohamiltonov graf