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
Facts
4 properties- Maintained by WikiProject
- WikiProject Mathematics[5]
- Named after
- William Rowan Hamilton[1]
- Studied by
- graph theory[4]
🏷️ Also known as
en hypohamiltonian graph
de hypohamiltonscher Graph
fr graphe hypohamiltonien
hu hypotraceable gráf
hu majdnem Hamilton-utas gráf
hu majdnem Hamilton-körös gráf
hu hipohamiltoni gráf
hu hypohamiltonian gráf
pt grafo hipohamiltoniano
ru гипогамильтонов граф
uk гіпогамільтонів граф
zh 亞哈密頓圖
🔖 Identifiers · 5
- Freebase ID
- /m/04cxyyp
- MathWorld ID
- HypohamiltonianGraph
- Microsoft Academic ID (discontinued)
- 2777892613
- PlanetMath ID
- Hypohamiltonian
- Wolfram Language entity code
- Entity["GraphClass", "Hypohamiltonian"]
🔗 Connections
Examples 4
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds