On r-hued list coloring of K₄ ( 7 )-minor free graphs

DOI10.1016/J.DAM.2021.12.013zbMATH Open1490.05088OpenAlexW4206017483MaRDI QIDQ2065804FDOQ2065804

Wei Xiong, Hong-Jian Lai, Fengxia Liu, Wenjuan Wei

Publication date: 13 January 2022

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

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

zbMATH Keywords

graph minor\(r\)-hued list chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The four-colour theorem
• 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
• On \(r\)-hued coloring of planar graphs with girth at least 6
• On the list dynamic coloring of graphs
• Dynamic coloring parameters for graphs with given genus
• Coloring the square of a \(K_{4}\)-minor free graph
• List-colouring the square of a \(K_4\)-minor-free graph
• Upper bounds of \(r\)-hued colorings of planar graphs
• Graph \(r\)-hued colorings -- a survey
• Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs

Cited In (2)

• Graph \(r\)-hued colorings -- a survey
• On list \(r\)-hued coloring of outer-1-planar graphs

This page was built for publication: On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs

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