New flip-flop constructions for hypohamiltonian graphs

DOI10.1016/0012-365X(77)90130-3zbMath0367.05046MaRDI QIDQ1242175

Edward F. Schmeichel, James B. Collier

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Planar hypohamiltonian oriented graphs ⋮ K₂‐Hamiltonian graphs: II ⋮ Improved bounds for hypohamiltonian graphs ⋮ On 4-ordered 3-regular graphs ⋮ Snarks, hypohamiltonian graphs and non-supereulerian graphs ⋮ Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Planar cubic hypohamiltonian and hypotraceable graphs ⋮ On Hypohamiltonian and Almost Hypohamiltonian Graphs ⋮ Fulkerson-covers of hypohamiltonian graphs ⋮ Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 ⋮ Exponentially many hypohamiltonian snarks

Cites Work

• Unnamed Item
• New families of hypohamiltonian graphs
• On hypohamiltonian graphs
• Systematic searches for hypohamiltonian graphs
• Flip-Flops in Hypohamiltonian Graphs