Distance colouring without one cycle length

DOI10.1016/j.endm.2017.07.025zbMath1378.05060arXiv1701.07639OpenAlexW2583600317MaRDI QIDQ1689995

François Pirot, Ross J. Kang

Publication date: 18 January 2018

Full work available at URL: https://arxiv.org/abs/1701.07639

zbMATH Keywords

graph colouringgraph powersdistance colouringexcluded cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

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

This page was built for publication: Distance colouring without one cycle length