Search results
Appearance
There is a page named "Hypohamiltonian graph" on Wikipedia
- mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing...24 KB (2,467 words) - 16:54, 28 November 2023
- deleting a single vertex does have the property. For instance, a hypohamiltonian graph is one that does not have a Hamiltonian cycle, but for which every...107 KB (15,784 words) - 17:42, 20 August 2024
- The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means that it does not itself have a Hamiltonian...6 KB (514 words) - 07:03, 6 December 2023
- Hamiltonian path (redirect from Hamiltonian graph)planar graphs to have a Hamiltonian cycle Hamiltonian path problem, the computational problem of finding Hamiltonian paths Hypohamiltonian graph, a non-Hamiltonian...18 KB (2,021 words) - 13:20, 12 August 2024
- mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful...24 KB (2,933 words) - 00:46, 29 August 2024
- graph is, in graph theory, a hypohamiltonian graph with 16 vertices and 27 edges. It has book thickness 3 and queue number 2. Hypohamiltonian graphs were...2 KB (252 words) - 07:16, 6 December 2023
- the sense that they are hypohamiltonian graphs: the removal of any single vertex leaves a Hamiltonian subgraph. A hypohamiltonian snark must be bicritical:...23 KB (2,707 words) - 07:38, 22 July 2024
- the Petersen graph, Tietze's graph is not hypohamiltonian: removing one of its three triangle vertices forms a smaller graph that remains non-Hamiltonian...6 KB (666 words) - 07:43, 18 July 2024
- and queue number 2. The Coxeter graph is hypohamiltonian: it does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex...7 KB (732 words) - 22:31, 9 August 2024
- with no cycles of length shorter than 5. Chapter seven is on hypohamiltonian graphs, the graphs that do not have a Hamiltonian cycle through all vertices...5 KB (616 words) - 23:35, 14 August 2024
- Szekeres snark (category Individual graphs)decompositions of cubic graphs". Bull. Austral. Math. Soc. 8 (3): 367–387. doi:10.1017/S0004972700042660. Weisstein, Eric W. "Hypohamiltonian Graph". MathWorld....2 KB (173 words) - 14:15, 17 September 2021
- Double-star snark (category Individual graphs)221–239, doi:10.2307/2319844, JSTOR 2319844 Weisstein, Eric W. "Hypohamiltonian Graph". MathWorld. Wolz, Jessica; Engineering Linear Layouts with SAT...2 KB (206 words) - 07:29, 5 June 2022
- Flower snark (category Parametric families of graphs)snark J5 is hypohamiltonian. J3 is a trivial variation of the Petersen graph formed by replacing one of its vertices by a triangle. This graph is also known...4 KB (373 words) - 07:44, 2 February 2023
- Grinberg's theorem (category Theorems in graph theory)Grinberg's theorem, the graph cannot be Hamiltonian. Grinberg's theorem has also been used to find planar hypohamiltonian graphs, graphs that are not Hamiltonian...9 KB (1,161 words) - 18:58, 28 January 2023
- is even and k is odd. G(n, k) is a Cayley graph if and only if k2 ≡ 1 (mod n). G(n, k) is hypohamiltonian when n is congruent to 5 modulo 6 and k = 2...13 KB (1,395 words) - 05:18, 25 May 2024
- John Adrian Bondy (category Graph theorists)Bondy's theorem Bondy–Chvátal theorem Even circuit theorem Hypohamiltonian graph Pancyclic graph John Adrian Bondy at the Mathematics Genealogy Project Charbit...10 KB (852 words) - 19:01, 28 December 2023
- Carsten Thomassen (mathematician) (category Graph theorists)Mohar: Graphs on surfaces, Johns Hopkins University Press 2001 5-choosability of planar graphs (see List coloring) works on Hypohamiltonian graphs Hamilton...3 KB (284 words) - 18:43, 28 February 2023
- Blanuša snarks (category Individual graphs)number 3, diameter 4 and girth 5. They are non-hamiltonian but are hypohamiltonian. Both have book thickness 3 and queue number 2. The automorphism group...4 KB (565 words) - 03:29, 16 June 2022