List coloring the square of sparse graphs with large degree

DOI10.1016/j.ejc.2014.03.006zbMath1300.05090arXiv1308.4197OpenAlexW2046676533MaRDI QIDQ740267

Alexandre Pinlou, Benjamin Lévêque, Marthe Bonamy

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Euler's formulalist \((\Delta + 1)\)-colorablelist injective \(\Delta\)-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items (6)

Planar graphs of girth at least five are square \((\delta + 2)\)-choosable ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ List 2-distance coloring of planar graphs with girth five ⋮ On coloring numbers of graph powers ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ An introduction to the discharging method via graph coloring

Cites Work

• Unnamed Item
• The average degree of a multigraph critical with respect to edge or total choosability
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• List edge and list total colourings of multigraphs
• Coloring squares of planar graphs with girth six
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• 2-distance coloring of sparse planar graphs
• On the total coloring of planar graphs.
• Labeling Planar Graphs with Conditions on Girth and Distance Two

This page was built for publication: List coloring the square of sparse graphs with large degree