Cycles in graphs of fixed girth with large size
From MaRDI portal
Publication:518183
DOI10.1016/j.ejc.2016.12.001zbMath1358.05152arXiv1603.03526OpenAlexW2296193615MaRDI QIDQ518183
Publication date: 28 March 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.03526
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- Cycle lengths in sparse graphs
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Cycles of even length in graphs
- Über ein Problem von K. Zarankiewicz
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
This page was built for publication: Cycles in graphs of fixed girth with large size
