\([r,s,t]\)-coloring of trees and bipartite graphs
From MaRDI portal
Publication:960923
DOI10.1016/j.disc.2008.09.021zbMath1215.05060OpenAlexW1971073571MaRDI QIDQ960923
Lyes Dekar, Hamamache Kheddouci, Brice Effantin
Publication date: 29 March 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.021
Related Items (5)
\([1,1,t\)-colorings of complete 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] ⋮ \([r,s,t\)-colorings of graph products]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
- On the chromatic number and independence number of hypergraph products
- \([r,s,t\)-colorings of graphs]
- \([r,s,t\)-chromatic numbers and hereditary properties of graphs]
- Determining the total colouring number is NP-hard
- Using stable sets to bound the chromatic number
- Total colouring regular bipartite graphs is NP-hard
- On planarity and colorability of circulant graphs
- Relations between the lower domination parameters and the chromatic number of a graph.
- Planar graphs of maximum degree seven are Class I
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- A bound on the chromatic number of the square of a planar graph
- Upper bounds for the chromatic number of a graph
- The NP-Completeness of Edge-Coloring
- Integral distance graphs
- Every planar graph with maximum degree 7 is of class 1
This page was built for publication: \([r,s,t]\)-coloring of trees and bipartite graphs
