Cycle-saturated graphs of minimum size

DOI10.1016/0012-365X(95)00173-TzbMath0856.05058OpenAlexW2006394242MaRDI QIDQ1916094

Curtiss Barefoot, T. D. Porter, Zsolt Tuza, László A. Székely, Lane H. Clark, Roger Entringer

Publication date: 2 July 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00173-t

zbMATH Keywords

cycleboundsextremal problemssaturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items

Saturation in the Hypercube and Bootstrap Percolation ⋮ All minimum C5-saturated graphs ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ Unnamed Item ⋮ MinimumK_{2, 3}-Saturated Graphs ⋮ \(C_{3}\) saturated graphs ⋮ \(C_{2k}\)-saturated graphs with no short odd cycles ⋮ On the number of edges in a minimum \(C_6\)-saturated graph

Cites Work

• Smallest maximally nonhamiltonian graphs
• Asymptotic results on saturated graphs
• Smallest maximally nonhamiltonian graphs. II
• Saturated graphs with minimal number of edges
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• A Problem in Graph Theory
• On a Conjecture of Erdos, Hajnal and Moon
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item