All minimum C5-saturated graphs
From MaRDI portal
Publication:2998920
DOI10.1002/jgt.20508zbMath1223.05130OpenAlexW2008544632MaRDI QIDQ2998920
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
Related Items (12)
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 ⋮ MinimumK2, 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
- 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 C5‐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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: All minimum C5-saturated graphs