K2‐Hamiltonian graphs: II
From MaRDI portal
Publication:6199383
DOI10.1002/jgt.23057arXiv2311.05262OpenAlexW4388961795MaRDI QIDQ6199383
Jan Goedgebeur, Carol T. Zamfirescu, Gábor Wiener, Unnamed Author
Publication date: 23 February 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2311.05262
Cites Work
- Generation and properties of snarks
- On cubic planar hypohamiltonian and hypotraceable graphs
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Non-Hamiltonian cubic planar maps
- Locally Hamiltonian graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- New flip-flop constructions for hypohamiltonian graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- 4-connected projective planar graphs are Hamiltonian
- House of graphs 2.0: a database of interesting graphs and more
- Practical graph isomorphism. II.
- Vertices missed by longest paths or circuits
- Planar Hypohamiltonian Graphs on 40 Vertices
- On planar hypohamiltonian graphs
- A Theorem on Planar Graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Hamiltonian Cycles and Uniquely Edge Colourable Graphs
- On hypohamiltonian snarks and a theorem of Fiorini
- Improved bounds for hypohamiltonian graphs
- New constructions of hypohamiltonian and hypotraceable graphs
- On Hamilton cycles in certain planar graphs
- $K_2$-Hamiltonian Graphs: I
- The minimality of the Georges–Kelmans graph
- Graphs with few hamiltonian cycles
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- Hypohamiltonian Planar Cubic Graphs with Girth 5
- Generation of Cubic Graphs and Snarks with Large Girth
- The Generation of Fullerenes
- Variations on the Hamiltonian Theme
- Flip-Flops in Hypohamiltonian Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: K2‐Hamiltonian graphs: II
