Distance colouring without one cycle length
From MaRDI portal
Publication:1689995
DOI10.1016/j.endm.2017.07.025zbMath1378.05060arXiv1701.07639OpenAlexW2583600317MaRDI QIDQ1689995
Publication date: 18 January 2018
Full work available at URL: https://arxiv.org/abs/1701.07639
Cites Work
- Unnamed Item
- Unnamed Item
- Problems and results in combinatorial analysis and graph theory
- Coloring graphs with sparse neighborhoods
- Cycles of even length in graphs
- Coloring Powers and Girth
- A note on the Turán function of even cycles
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- The Chromatic Number of Graph Powers
- The strong chromatic index ofC4-free graphs
- The Distance-t Chromatic Index of Graphs