A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5

DOI10.1142/S1793830918500441zbMath1393.05123MaRDI QIDQ4577850

Tao Pan, Lei Sun

Publication date: 3 August 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

girthmaximum degree2-distance coloringlist 2-distance coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• On 2-distance coloring of plane graphs with girth 5
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• An optimal square coloring of planar graphs
• Coloring squares of planar graphs with girth six
• List 2-distance coloring of planar graphs without short cycles
• Labeling Planar Graphs with Conditions on Girth and Distance Two

This page was built for publication: A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5