Smallest maximally nonhamiltonian graphs. II

DOI10.1007/BF02349959zbMath0758.05066MaRDI QIDQ1199118

Henry D. Shapiro, Roger Entringer, Lane H. Clark

Publication date: 16 January 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

nonhamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (12)

Cubic maximal nontraceable graphs ⋮ Cycle-saturated graphs of minimum size ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Saturation numbers for families of graph subdivisions ⋮ Smallest maximally nonhamiltonian graphs. II ⋮ Hamilton-chain saturated hypergraphs ⋮ Hamiltonian path saturated graphs with small size ⋮ On the size of maximally non-hamiltonian digraphs ⋮ 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

• Arc coverings of graphs
• Smallest maximally nonhamiltonian graphs. II
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Variations on the Hamiltonian Theme
• Unnamed Item

This page was built for publication: Smallest maximally nonhamiltonian graphs. II