\(C_{2k}\)-saturated graphs with no short odd cycles
From MaRDI portal
Publication:2334067
DOI10.1007/s00373-019-02054-xzbMath1426.05076arXiv1810.05772MaRDI QIDQ2334067
Publication date: 6 November 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.05772
05C38: Paths and cycles
Related Items
Cites Work
- A survey of minimum saturated graphs
- Cycle-saturated graphs of minimum size
- Generalized Turán problems for even cycles
- On the number of edges in a minimum \(C_6\)-saturated graph
- All minimum C5-saturated graphs
- Minimum C5‐saturated graphs
- Saturated graphs with minimal number of edges
- Cycle-Saturated Graphs with Minimum Number of Edges
- A generalized Turán problem and its applications
- A Problem in Graph Theory
- Constructive upper bounds for cycle-saturated graphs of minimum size
- Many \(T\) copies in \(H\)-free graphs