\([r,s,t]\)-colorings of graphs
From MaRDI portal
Publication:864161
DOI10.1016/J.DISC.2006.06.030zbMath1115.05033OpenAlexW2066602031MaRDI QIDQ864161
Massimiliano Marangio, Arnfried Kemnitz
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.030
Related Items (16)
A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) ⋮ \([1,1,t\)-colorings of complete graphs] ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ The \((p,q)\)-total labeling problem for trees ⋮ \([r,s,t\)-colorings of friendship graphs and wheels] ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ (2,1)-total labelling of trees with sparse vertices of maximum degree ⋮ Unnamed Item ⋮ \((2,1)\)-Total number of trees with maximum degree three ⋮ \([r,s,t\)-colorings of graph products] ⋮ \([r,s,t\)-coloring of \(K_{n,n}\)] ⋮ On \((d,1)\)-total numbers of graphs ⋮ Two results on K-(2,1)-total choosability of planar graphs ⋮ \((2,1)\)-total labeling of trees with large maximum degree
Cites Work
- Unnamed Item
- The total chromatic number of graphs having large maximum degree
- A bound on the total chromatic number
- 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.
- On total 9-coloring planar graphs of maximum degree seven
- 25 pretty graph colouring problems
This page was built for publication: \([r,s,t]\)-colorings of graphs
