\([r,s,t]\)-coloring of trees and bipartite graphs
type: Item
instance of: scholarly article
title: \([r,s,t]\)-coloring of trees and bipartite graphs
zbMATH Open document ID: 1215.05060
author: Lyes Dekar
author: Brice Effantin
author: H. Kheddouci
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5687555
zbMATH Keywords: \([r, s, t]\)-coloring
zbMATH Keywords: bipartite graphs
zbMATH Keywords: generalized coloring
zbMATH Keywords: stars, total coloring
zbMATH Keywords: trees
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.021
OpenAlex ID: W1971073571
cites work: \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
cites work: Q5782525
cites work: Relations between the lower domination parameters and the chromatic number of a graph.
cites work: Integral distance graphs
cites work: An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
cites work: Using stable sets to bound the chromatic number
cites work: On planarity and colorability of circulant graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Q5443246
cites work: \([r,s,t]\)-colorings of graphs
cites work: \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
cites work: Total colouring regular bipartite graphs is NP-hard
cites work: A bound on the chromatic number of the square of a planar graph
cites work: On the chromatic number and independence number of hypergraph products
cites work: Q4242948
cites work: Determining the total colouring number is NP-hard
cites work: Planar graphs of maximum degree seven are Class I
cites work: Upper bounds for the chromatic number of a graph
cites work: Q3515428
cites work: Q3598057
cites work: Q5558480
cites work: Every planar graph with maximum degree 7 is of class 1
DOI: 10.1016/J.DISC.2008.09.021
Recommended article: \([r,s,t]\)-colorings of graphs
Recommended article: COMPOUND-COMMUTING ADDITIVE MAPS ON MATRIX SPACES
Recommended article: Colourings of (k-r,k)-trees
Recommended article: A note on \([r, s, c, t]\)-colorings of graphs
Recommended article: \(b\)-colouring the Cartesian product of trees and some other graphs
Recommended article: Cooperative colorings of trees and of bipartite graphs
Recommended article: \(T\)-colorings of graphs
Recommended article: \(b\)-coloring of some bipartite graphs
Recommended article: On cd-coloring of trees and co-bipartite graphs
Recommended article: Q3515428
description: scientific article; zbMATH DE number 5687555