\([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.11.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054170757 / rank
 
Normal rank

Revision as of 01:48, 20 March 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
    0 references
    0 references
    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

    Identifiers