\([r,s,t]\)-chromatic numbers and hereditary properties of graphs
From MaRDI portal
Publication:868364
DOI10.1016/j.disc.2005.11.055zbMath1115.05034OpenAlexW2054170757MaRDI QIDQ868364
Arnfried Kemnitz, Peter Mihók, Massimiliano Marangio
Publication date: 2 March 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.055
Related Items (6)
\([1,1,t\)-colorings of complete graphs] ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ \([r,s,t\)-colorings of friendship graphs and wheels] ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ \([r,s,t\)-colorings of graph products] ⋮ On \((d,1)\)-total numbers of graphs
Cites Work
- Unnamed Item
- The total chromatic number of graphs having large maximum degree
- \([r,s,t\)-colorings of graphs]
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- On the total coloring of planar graphs.
- A survey of hereditary properties of graphs
- On total 9-coloring planar graphs of maximum degree seven
- 25 pretty graph colouring problems
This page was built for publication: \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
