2-distance coloring of planar graphs without 4-cycles

zbMATHMaRDI QIDQ3131052FDO

Authors Yuehua Bu, Chunhui Shang

Publication date 29 January 2018

zbMATH Keywords

cyclesmaximum degreeplanar graphs2-distance coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(10)

• \(2\)-distance coloring of planar graph
• scientific article; zbMATH DE number 7029178 (Why is no real title available?)
• The 2-distance chromatic number of planar graphs without 3,4,8-cycles
• 2-distance coloring of planar graphs without 3, 4, 8-cycles
• scientific article; zbMATH DE number 7111892 (Why is no real title available?)
• 2-distance 4-colorability of planar subcubic graphs with girth at least 22
• 2-distance coloring of planar graphs without adjacent 5-cycles
• 2-distance coloring of a planar graph without 3, 4, 7-cycles
• 2-Distance coloring of planar graphs without short cycles
• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles

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

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