List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
From MaRDI portal
Publication:1709519
DOI10.1016/j.disc.2018.01.002zbMath1383.05120OpenAlexW2793195622MaRDI QIDQ1709519
Huimin Song, Hong-Jian Lai, Jian Liang Wu
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.01.002
square coloringmaximum average degree\((k, r)\)-coloring\(r\)-hued chromatic numberlist \((k, r)\)-coloring
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (2)
Graph \(r\)-hued colorings -- a survey ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- Dynamic list coloring of bipartite graphs
- On the dynamic coloring of graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- Distance constrained labelings of planar graphs with no short cycles
- On the list dynamic coloring of graphs
- Complexity of conditional colorability of graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- On \(r\)-dynamic coloring of grids
- Coloring squares of planar graphs with girth six
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
This page was built for publication: List \(r\)-hued chromatic number of graphs with bounded maximum average degrees
