On r-hued coloring of planar graphs with girth at least 6

DOI10.1016/J.DAM.2015.05.015zbMATH Open1327.05085OpenAlexW969137341MaRDI QIDQ897613FDOQ897613

Authors: Huimin Song, Hong-Jian Lai, Jian-Liang Wu 

Publication date: 7 December 2015

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

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

Recommendations

• On \(r\)-hued coloring of planar graphs with girth at least 5
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
• On \(r\)-hued coloring of planar graphs
• Upper bounds of \(r\)-hued colorings of planar graphs
• \(r\)-hued coloring of planar graphs without short cycles

zbMATH Keywords

girthplanar graph\(r\)-hued coloring\((k, r)\)-coloring

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Complexity of conditional colorability of 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?)
• An optimal square coloring of planar graphs
• Coloring the square of a \(K_{4}\)-minor free graph

Cited In (24)

• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
• Element deletion changes in dynamic coloring of graphs
• r-Hued coloring of planar graphs without short cycles
• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• On the \(r\)-dynamic coloring of subdivision-edge coronas of a path
• List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
• List 3-dynamic coloring of graphs with small maximum average degree
• List \(r\)-dynamic coloring of graphs with small maximum average degree
• On \(r\)-hued colorings of graphs without short induced paths
• Title not available (Why is that?)
• 3-dynamic coloring of planar triangulations
• On list 3-dynamic coloring of near-triangulations
• Upper bounds of \(r\)-hued colorings of planar graphs
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
• Graph \(r\)-hued colorings -- a survey
• Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
• List \(r\)-dynamic coloring of sparse graphs
• \(r\)-hued coloring of sparse graphs
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles
• Title not available (Why is that?)
• Optimal \(r\)-dynamic coloring of sparse graphs
• Linear list r-hued coloring of sparse graphs
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)

This page was built for publication: On \(r\)-hued coloring of planar graphs with girth at least 6

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