r-Hued coloring of planar graphs without short cycles

DOI10.1142/S1793830920500342zbMath1456.05037OpenAlexW3008718418MaRDI QIDQ4965904

Yuehua Bu, Xiao-Fang Wang

Publication date: 18 March 2021

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

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

zbMATH Keywords

cycleplanar graphWagner's conjecturehued coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Graph \(r\)-hued colorings -- a survey

Cites Work

• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• On \(r\)-hued coloring of planar graphs with girth at least 6
• 不含3, 4, 8-圈的平面图的2-距离染色
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: r-Hued coloring of planar graphs without short cycles