On \(r\)-hued colorings of graphs without short induced paths
From MaRDI portal
Publication:2421855
DOI10.1016/j.disc.2019.03.017zbMath1414.05120OpenAlexW2937881716MaRDI QIDQ2421855
Murong Xu, Hong-Jian Lai, Xue-Zheng Lv
Publication date: 18 June 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.03.017
\(P_5\)-free graphs\(r\)-hued chromatic number\(P_4\)-free graphs\((k,r)\)-coloring\((r,s)\)-normality
Related Items
On the \(r\)-dynamic coloring of subdivision-edge coronas of a path ⋮ Graph \(r\)-hued colorings -- a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- On the difference between chromatic number and dynamic chromatic number of graphs
- Dynamic list coloring of bipartite graphs
- On the dynamic coloring of graphs
- Dynamic chromatic number of regular graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- The strong perfect graph theorem
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On \(r\)-dynamic chromatic number of graphs
- On the list dynamic coloring of graphs
- Complexity of conditional colorability of graphs
- Dominating cliques in \(P_ 5\)-free graphs
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- On \(r\)-dynamic coloring of grids
- Dynamic coloring and list dynamic coloring of planar graphs
- Conditional colorings of graphs
- On a property of the class of n-colorable graphs
- List Dynamic Coloring of Sparse Graphs
