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
Press Enter · cited answer in seconds
0 sources
hypohamiltonian graph
Summary
hypohamiltonian graph ranks in the top 2% of general entities by monthly Wikipedia readership (9 views/month).[1]
Key Facts
- hypohamiltonian graph's image is recorded as Lindgren hypohamiltonian 15.svg[2].
- William Rowan Hamilton is named after hypohamiltonian graph[3].
- hypohamiltonian graph's subclass of is recorded as triconnected graph[4].
- hypohamiltonian graph's subclass of is recorded as almost Hamiltonian graph[5].
- hypohamiltonian graph's Freebase ID is recorded as /m/04cxyyp[6].
- hypohamiltonian graph's studied by is recorded as graph theory[7].
- hypohamiltonian graph's MathWorld ID is recorded as HypohamiltonianGraph[8].
- hypohamiltonian graph's Wolfram Language entity code is recorded as Entity["GraphClass", "Hypohamiltonian"][9].
- hypohamiltonian graph's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- hypohamiltonian graph's Microsoft Academic ID is recorded as 2777892613[11].
- hypohamiltonian graph's PlanetMath ID is recorded as Hypohamiltonian[12].
Why It Matters
hypohamiltonian graph ranks in the top 2% of general entities by monthly Wikipedia readership (9 views/month).[1] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[13] It is known by 4 alternative names across languages and contexts.[14]