Upper bounds of r-hued colorings of planar graphs

DOI10.1016/J.DAM.2017.12.041zbMATH Open1387.05098OpenAlexW2792621921MaRDI QIDQ1752467FDOQ1752467

Huimin Song, Hong-Jian Lai

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.041

Recommendations

• On \(r\)-hued coloring of planar graphs
• On \(r\)-hued coloring of planar graphs with girth at least 6
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• On \(r\)-hued coloring of planar graphs with girth at least 5
• 3-hued coloring of planar graphs

zbMATH Keywords

planar graphdynamic chromatic numberdynamic coloring\(r\)-hued coloring\((k, r)\)-coloring\(r\)-hued chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complexity of conditional colorability of graphs
• Dynamic coloring and list dynamic coloring of planar graphs
• Conditional colorings of graphs
• On \(r\)-hued coloring of \(K_4\)-minor free graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• Title not available (Why is that?)
• On \(r\)-hued coloring of planar graphs with girth at least 6
• Dynamic coloring parameters for graphs with given genus
• Coloring the square of a planar graph
• Coloring the square of a \(K_{4}\)-minor free graph

Cited In (12)

• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Wegner's conjecture on 2-distance coloring for planar graphs
• On r-hued coloring of product graphs
• Wegner's conjecture on 2-distance coloring
• The list \(r\)-hued coloring of \(K_{m, n}\)
• On list \(r\)-hued coloring of planar graphs
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
• Graph \(r\)-hued colorings -- a survey
• List \(r\)-dynamic coloring of sparse graphs
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)

This page was built for publication: Upper bounds of \(r\)-hued colorings of planar graphs

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