List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles

DOI10.1002/jgt.22101zbMath1368.05047arXiv1505.03197OpenAlexW2293855371MaRDI QIDQ4978441

Bobby Jaeger, Daniel W. Cranston

Publication date: 10 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar graph\(L(2,1)\)-labelinglist coloringsquare of a graphpaintability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Coloring the square of maximal Planar graphs with diameter two ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles

Cites Work

• 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 without 4,5-Cycles with a Condition on Distance Two
• List Colouring Squares of Planar Graphs
• List-coloring the square of a subcubic graph
• Coloring Powers of Planar Graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph

This page was built for publication: List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles