Improved bounds for hypohamiltonian graphs
From MaRDI portal
Publication:4604513
DOI10.26493/1855-3974.1044.eaazbMath1380.05034arXiv1602.07171OpenAlexW2275596707WikidataQ129366270 ScholiaQ129366270MaRDI QIDQ4604513
Carol T. Zamfirescu, Jan Goedgebeur
Publication date: 26 February 2018
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07171
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Forbidden configurations for hypohamiltonian graphs ⋮ Structural and computational results on platypus graphs ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ On minimum leaf spanning trees and a criticality notion ⋮ Planar hypohamiltonian oriented graphs ⋮ K2‐Hamiltonian graphs: II ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ GenHypohamiltonian
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generation and properties of snarks
- On cubic planar hypohamiltonian and hypotraceable graphs
- Infinitely many hypohamiltonian cubic graphs of girth 7
- Circuit preserving edge maps. II
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Planar and infinite hypohamiltonian and hypotraceable graphs
- New flip-flop constructions for hypohamiltonian graphs
- Planar cubic hypohamiltonian and hypotraceable graphs
- Ein planarer hypohamiltonscher Graph mit 57 Knoten
- Hypohamiltonian and hypotraceable graphs
- A theorem on graphs
- House of Graphs: a database of interesting graphs
- On hypohamiltonian graphs
- Hypohamiltonian graphs and their crossing number
- Practical graph isomorphism. II.
- Vertices missed by longest paths or circuits
- Planar Hypohamiltonian Graphs on 40 Vertices
- On planar hypohamiltonian graphs
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- A planar hypohamiltonian graph with 48 vertices
- Systematic searches for hypohamiltonian graphs
- Fast generation of regular graphs and construction of cages
- Isomorph-Free Exhaustive Generation
- On hypohamiltonian snarks and a theorem of Fiorini
- New constructions of hypohamiltonian and hypotraceable graphs
- Nonhamiltonian 3-Connected Cubic Planar Graphs
- On almost hypohamiltonian graphs
- On Hypohamiltonian and Almost Hypohamiltonian Graphs
- Generation of Cubic Graphs and Snarks with Large Girth
- The Generation of Fullerenes
- n-Hamiltonian graphs
- Flip-Flops in Hypohamiltonian Graphs
This page was built for publication: Improved bounds for hypohamiltonian graphs
