Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
From MaRDI portal
Publication:5162867
DOI10.19086/aic.18971zbMath1478.05040arXiv1904.05076OpenAlexW3122324696MaRDI QIDQ5162867
Kasper Szabo Lyngsie, Martin Merker
Publication date: 5 November 2021
Published in: Advances in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.05076
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extremal function for cycles of length \(\ell\) mod \(k\)
- Girth in graphs
- Cycles with consecutive odd lengths
- Cycle lengths in sparse graphs
- Cycles of length 2 modulo 3 in graphs
- Cycles of length 0 modulo 4 in graphs
- Graphs with a cycle of length divisible by three
- Cycle lengths and minimum degree of graphs
- Distribution of cycle lengths in graphs
- On Arithmetic Progressions of Cycle Lengths in Graphs
- Unavoidable cycle lengths in graphs
- Cycles of even lengths modulo k
- Graph decomposition with applications to subdivisions and path systems modulo k
- Cycles Modulo k
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Pancyclicity mod \(k\) of claw-free graphs and \(K_{1,4}\)-free graphs
- Cycles of length 1 modulo 3 in graph
This page was built for publication: Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
