Coloring squares of graphs with mad constraints

DOI10.1016/j.dam.2019.08.011zbMath1428.05108arXiv1902.08135OpenAlexW2971389304MaRDI QIDQ2009007

Seog-Jin Kim, Hervé Hocquard, Théo Pierron

Publication date: 27 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringdischarging methodsquare coloringmaximum average degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

On coloring numbers of graph powers

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Coloring the square of graphs whose maximum average degree is less than 4
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The square of a planar cubic graph is 7-colorable
• A unified approach to distance-two colouring of graphs on surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring squares of graphs with mad constraints