Coloring the square of graphs whose maximum average degree is less than 4

DOI10.1016/j.disc.2015.11.012zbMath1329.05112arXiv1506.04401OpenAlexW584708941MaRDI QIDQ906469

Seog-Jin Kim, Boram Park

Publication date: 21 January 2016

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

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

zbMATH Keywords

coloringsquare coloringmaximum average degree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ On coloring numbers of graph powers ⋮ Coloring squares of graphs with mad constraints ⋮ 3-dynamic coloring of planar triangulations

Cites Work

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• List coloring the square of sparse graphs with large degree
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• Coloring squares of planar graphs with girth six
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring the square of graphs whose maximum average degree is less than 4