Cycle-Saturated Graphs with Minimum Number of Edges
From MaRDI portal
Publication:4920660
DOI10.1002/jgt.21668zbMath1262.05084arXiv1103.0067OpenAlexW1913858864MaRDI QIDQ4920660
Publication date: 21 May 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.0067
Related Items (16)
Almost all permutation matrices have bounded saturation functions ⋮ 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 of Ordered Graphs ⋮ Cycle Saturation in Random Graphs ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ Saturation problems in the Ramsey theory of graphs, posets and point sets ⋮ Saturation Problems about Forbidden 0-1 Submatrices ⋮ MinimumK2, 3-Saturated Graphs ⋮ \(C_{2k}\)-saturated graphs with no short odd cycles ⋮ Graph cover-saturation ⋮ Saturation numbers for disjoint stars ⋮ Minimum \(t P_3\)-saturation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The saturation function of complete partite graphs
- A survey of minimum saturated graphs
- tK\(_p\)-saturated graphs of minimum size
- An extremal problem for sets with applications to graph theory
- An extremal problem for two families of sets
- Cycle-saturated graphs of minimum size
- All minimum C5-saturated graphs
- Minimum C5‐saturated graphs
- Saturated graphs with minimal number of edges
- On maximal triangle‐free graphs
- Onk-saturated graphs with restrictions on the degrees
- A Problem in Graph Theory
- On generalized graphs
- Constructive upper bounds for cycle-saturated graphs of minimum size
This page was built for publication: Cycle-Saturated Graphs with Minimum Number of Edges
