\([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \([r,s,t]\)-chromatic numbers and hereditary properties of graphs |
scientific article |
Statements
\([r,s,t]\)-chromatic numbers and hereditary properties of graphs (English)
0 references
2 March 2007
0 references
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\).
0 references
generalized colorings
0 references
