Smallest maximally nonhamiltonian graphs

DOI10.1007/BF02023582zbMath0489.05038WikidataQ55920249 ScholiaQ55920249MaRDI QIDQ1166539

Lane H. Clark, Roger Entringer

Publication date: 1983

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

snarkshypohamiltonian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (20)

Nontraceable detour graphs ⋮ Cubic maximal nontraceable graphs ⋮ Structural and computational results on platypus graphs ⋮ Cycle-saturated graphs of minimum size ⋮ Rotationally symmetric snarks from voltage graphs ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ Spiders everywhere ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Saturation numbers for families of graph subdivisions ⋮ Hamilton-chain saturated hypergraphs ⋮ Hamiltonian path saturated graphs with small size ⋮ Upper bounds on the minimum size of Hamilton saturated hypergraphs ⋮ Large Isaacs' graphs are maximally non-Hamilton-connected ⋮ On the size of maximally non-hamiltonian digraphs ⋮ Towards obtaining a 3-decomposition from a perfect matching ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Computer based proofs by induction in graph theory - A house of cards? ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\) ⋮ On the number of edges in a minimum \(C_6\)-saturated graph

Cites Work

• Unnamed Item
• Arc coverings of graphs
• A Non-Hamiltonian Graph
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Variations on the Hamiltonian Theme
• Flip-Flops in Hypohamiltonian Graphs

This page was built for publication: Smallest maximally nonhamiltonian graphs