2-distance coloring of planar graph

DOI10.1142/S1793830921500075zbMATH Open1475.05063OpenAlexW3049187461MaRDI QIDQ5012803FDOQ5012803

Authors: Yuehua Bu, Jiao Jiao Cao 

Publication date: 25 November 2021

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

Full work available at URL: https://doi.org/10.1142/s1793830921500075

Recommendations

• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• 2-Distance coloring of planar graphs without short cycles
• 2-distance coloring of planar graphs without 4-cycles

zbMATH Keywords

cyclegirthplanar graph\(2\)-distance coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• Coloring Powers of Planar Graphs
• List 2-distance coloring of planar graphs without short cycles
• List 2-distance coloring of planar graphs
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• 2-distance coloring of sparse planar graphs

Cited In (15)

• The \(k\)-distance chromatic number of trees and cycles
• Title not available (Why is that?)
• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• 2-distance coloring of planar graphs without adjacent 5-cycles
• On d-distance equitable chromatic number of some graphs
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-Distance coloring of planar graphs without short cycles
• A Frameless 2-Coloring of the Plane Lattice
• List 2-distance coloring of planar graphs
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• Title not available (Why is that?)
• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• 2-distance coloring of planar graphs without 4-cycles

This page was built for publication: \(2\)-distance coloring of planar graph

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