Minimum C5‐saturated graphs
From MaRDI portal
Publication:3633000
DOI10.1002/jgt.20372zbMath1179.05057OpenAlexW1584653855MaRDI QIDQ3633000
Publication date: 16 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20372
Related Items (19)
Saturating Sperner families ⋮ The partite saturation number of spider ⋮ Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph ⋮ Saturation for the 3-uniform loose 3-cycle ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ Cycle Saturation in Random Graphs ⋮ Some results on the saturation number for unions of cliques ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Induced saturation number ⋮ 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 ⋮ The game of \(\mathcal F\)-saturator ⋮ Unnamed Item ⋮ MinimumK2, 3-Saturated Graphs ⋮ \(C_{2k}\)-saturated graphs with no short odd cycles ⋮ Saturation numbers for disjoint stars ⋮ Minimum \(t P_3\)-saturation graphs ⋮ On the number of edges in a minimum \(C_6\)-saturated graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Saturated \(r\)-uniform hypergraphs
- On the number of edges of quadrilateral-free graphs
- Weakly Saturated Hypergraphs and Exterior Algebra
- Saturated graphs with minimal number of edges
- The Minimum Size of Saturated Hypergraphs
- Constructive upper bounds for cycle-saturated graphs of minimum size
This page was built for publication: Minimum C5‐saturated graphs