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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of graphs having large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \([r,s,t]\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of any multigraph with maximum degree five is at most seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total 9-coloring planar graphs of maximum degree seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank

Latest revision as of 15:24, 25 June 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
    0 references
    generalized colorings
    0 references
    0 references