All minimum C5-saturated graphs

DOI10.1002/JGT.20508zbMath1223.05130OpenAlexW2008544632MaRDI QIDQ2998920

Ya-Chen Chen

Publication date: 11 May 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20508

zbMATH Keywords

extremal graphsforbidden subgraphs\(C_{5}\)-saturated graphs

Mathematics Subject Classification ID

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

Related Items (13)

Saturating Sperner families ⋮ On saturated \(k\)-Sperner systems ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ Saturation numbers for linear forests $P_6 + tP_2$ ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Cycle-Saturated Graphs with Minimum Number of Edges ⋮ Unnamed Item ⋮ Saturation numbers of joins of graphs ⋮ MinimumK_{2, 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Saturated \(r\)-uniform hypergraphs
• Graphs without quadrilaterals
• Cycle-saturated graphs of minimum size
• On the number of edges of quadrilateral-free graphs
• \(C_{3}\) saturated graphs
• Weakly Saturated Hypergraphs and Exterior Algebra
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• The Minimum Size of Saturated Hypergraphs
• A Problem in Graph Theory
• On generalized graphs
• Constructive upper bounds for cycle-saturated graphs of minimum size

This page was built for publication: All minimum C5-saturated graphs