\([r,s,t]\)-chromatic numbers and hereditary properties of graphs
type: Item
instance of: scholarly article
title: \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
zbMATH Open document ID: 1115.05034
author: Arnfried Kemnitz
author: Massimiliano Marangio
author: Peter Mihók
published in: Discrete Mathematics
publication date: 2007-03-02T00:00:00Z
review text: The first two authors introduced \([r,s,t]\)-colorings of graphs in [Discrete Math. 307, No. 2, 199--207 (2007; Zbl 1115.05033)]. In the current paper the authors prove several results concerning the graphs \(G\) with \(\chi _{r,s,t}(G)=k\) when \(k\leq 3\) or \(\max \{r,s,t\}=1\).
reviewed by: L. Traldi
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5130452
zbMATH Keywords: generalized colorings
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.055
OpenAlex ID: W2054170757
cites work: On the total coloring of planar graphs.
cites work: A survey of hereditary properties of graphs
cites work: Q5782525
cites work: The total chromatic number of graphs having large maximum degree
cites work: 25 pretty graph colouring problems
cites work: \([r,s,t]\)-colorings of graphs
cites work: The total chromatic number of any multigraph with maximum degree five is at most seven
cites work: On total 9-coloring planar graphs of maximum degree seven
cites work: Total colourings of graphs
DOI: 10.1016/J.DISC.2005.11.055
description: scientific article; zbMATH DE number 5130452