Planar Hypohamiltonian Graphs on 40 Vertices
From MaRDI portal
Publication:2958202
DOI10.1002/jgt.22015zbMath1356.05029arXiv1302.2698MaRDI QIDQ2958202
Carol T. Zamfirescu, Mohammadreza Jooyandeh, Ville H. Pettersson, Brendan D. McKay, Patric R. J. Östergård
Publication date: 1 February 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.2698
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
Forbidden configurations for hypohamiltonian graphs, Improved bounds for hypohamiltonian graphs, $K_2$-Hamiltonian Graphs: I, Planar hypohamiltonian oriented graphs, On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs, K2‐Hamiltonian graphs: II, On constructions of hypotraceable graphs, Grinberg's criterion, Gallai's question and constructions of almost hypotraceable graphs, On minimum leaf spanning trees and a criticality notion, Gallai's property for graphs in lattices on the torus and the Möbius strip, Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On cubic planar hypohamiltonian and hypotraceable graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Non-Hamiltonian non-Grinbergian graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- Ein planarer hypohamiltonscher Graph mit 57 Knoten
- Hypohamiltonian and hypotraceable graphs
- House of Graphs: a database of interesting graphs
- On hypohamiltonian graphs
- A two-connected planar graph without concurrent longest paths
- Vertices missed by longest paths or circuits
- Construction of planar triangulations with minimum degree 5
- On planar hypohamiltonian graphs
- A planar hypohamiltonian graph with 48 vertices
- On longest paths and circuits in graphs.
- Intersecting longest paths and longest cycles: A survey
- Flip-Flops in Hypohamiltonian Graphs
