2-distance coloring of planar graphs without 4-cycles and 5-cycles

DOI10.1137/17M1157313MaRDI QIDQ5232154zbMATH OpenOpenAlexWikidataFDO

Authors Wei Dong, Baogang Xu

Publication date 29 August 2019

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/17m1157313

zbMATH Keywords

planar graphshort cycles2-distance coloring

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)

Recommendations

• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• 2-Distance coloring of planar graphs without short cycles
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)

Cites work

• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• 2-distance coloring of planar graphs with girth 5
• 2-distance coloring of sparse planar graphs
• A bound on the chromatic number of the square of a planar graph
• An improved bound on 2-distance coloring plane graphs with girth 5
• An optimal square coloring of planar graphs
• Coloring Powers of Planar Graphs
• Coloring squares of planar graphs with girth six
• Coloring the square of a planar graph
• Graph theory
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Labelling planar graphs without 4-cycles with a condition on distance two
• List-coloring the squares of planar graphs without 4-cycles and 5-cycles
• On 2-distance coloring of plane graphs with girth 5
• Planar graphs of girth at least five are square ( + 2)-choosable
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• The L(p, q)-labelling of planar graphs without 4-cycles
• The square of a planar cubic graph is 7-colorable

Cited in

(13)

• Degeneracy and colorings of squares of planar graphs without 4-cycles
• 2-distance choice number of planar graphs with maximal degree no more than 4
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-Distance coloring of planar graphs without short cycles
• Wegner's conjecture on 2-distance coloring
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• The 2-distance chromatic number of planar graphs without 3,4,8-cycles
• An improved bound for 2-distance coloring of planar graphs with girth six
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• Coloring squares of planar graphs with maximum degree at most five
• -binding functions for squares of convex bipartite graphs and partite testability for bipartite squares
• scientific article; zbMATH DE number 7029178 (Why is no real title available?)
• On L (p, q)-labelling of planar graphs without cycles of length four

This page was built for publication: 2-distance coloring of planar graphs without 4-cycles and 5-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232154)