An optimal square coloring of planar graphs

DOI10.1007/s10878-011-9409-zzbMath1261.05022MaRDI QIDQ1928491

Xubo Zhu, Yuehua Bu

Publication date: 3 January 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9409-z

zbMATH Keywords

planar graphs; girth; maximum degree; square of a graph

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5, 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles, 2-Distance chromatic number of some graph products, Colouring a dominating set without conflicts: \(q\)-subset square colouring, An improved bound on 2-distance coloring plane graphs with girth 5, Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors, On 2-distance coloring of plane graphs with girth 5, List 2-distance coloring of planar graphs, On \(r\)-hued coloring of planar graphs with girth at least 6, Optimal channel assignment and \(L(p,1)\)-labeling, 2-distance coloring of planar graphs with girth 5, The square of a planar cubic graph is 7-colorable, List \(r\)-dynamic coloring of graphs with small maximum average degree, Coloring a dominating set without conflicts: \(q\)-subset square coloring, List 2-distance coloring of planar graphs with girth five, Sharp upper bound of injective coloring of planar graphs with girth at least 5, 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10, Graph \(r\)-hued colorings -- a survey, \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\), List \(r\)-dynamic coloring of sparse graphs, Optimal \(r\)-dynamic coloring of sparse graphs, Coloring squares of planar graphs with maximum degree at most five, List 2-distance coloring of planar graphs without short cycles

Cites Work

• List injective colorings of planar graphs
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
• A coloring problem on the \(n\)-cube
• The square of a planar cubic graph is 7-colorable
• A channel assignment problem for optical networks modelled by Cayley graphs
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• List-coloring the square of a subcubic graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Choosability conjectures and multicircuits