Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
From MaRDI portal
Publication:2189858
DOI10.1016/j.amc.2020.125206OpenAlexW3031537225MaRDI QIDQ2189858
Ye Chen, Suohai Fan, Huimin Song, Murong Xu, Hong-Jian Lai
Publication date: 17 June 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125206
Related Items
Graph \(r\)-hued colorings -- a survey, On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs, On list \(r\)-hued coloring of outer-1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic coloring of graphs having no \(K_5\) minor
- 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
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The four-colour theorem
- Coloring the square of a \(K_{4}\)-minor free graph
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs