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

DOI10.1137/17M1157313zbMATH Open1426.05041OpenAlexW2963895478WikidataQ127460821 ScholiaQ127460821MaRDI QIDQ5232154FDOQ5232154

Baogang Xu, Wei Dong

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

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\)

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)

Cites Work

• Title not available (Why is that?)
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• 2-distance coloring of planar graphs with girth 5
• An optimal square coloring of planar graphs
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• 2-distance coloring of sparse planar graphs
• An improved bound on 2-distance coloring plane graphs with girth 5
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• On 2-distance coloring of plane graphs with girth 5
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Coloring Powers of Planar Graphs
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• 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
• The square of a planar cubic graph is 7-colorable

Cited In (6)

• Degeneracy and colorings of squares of planar graphs without 4-cycles
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-Distance coloring of planar graphs without short cycles
• Coloring squares of planar graphs with maximum degree at most five
• Title not available (Why is that?)
• 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)