On r-regular r-connected non-hamiltonian graphs

DOI10.1017/S0004972700007589zbMath0462.05041MaRDI QIDQ3912823

Brad Jackson, T. D. Parsons

Publication date: 1981

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

snarkedge colouringhamiltonian cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Existence of graphs with specified cycle lengths ⋮ Longest cycles in r-regular r-connected graphs

Cites Work

• Unnamed Item
• A minimal condition implying a special K\(_4\)-subdivision in a graph
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Vertices missed by longest paths or circuits
• Maximal Flow Through a Network
• Longest Cycles in 3-Connected 3-Regular Graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On longest paths and circuits in graphs.
• Polytopes, graphs, and complexes
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• On Hamiltonian Circuits

This page was built for publication: On r-regular r-connected non-hamiltonian graphs