The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of triangles in a \(K_4\)-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring series-parallel graphs / rank
 
Normal rank

Latest revision as of 16:12, 24 June 2024

scientific article
Language Label Description Also known as
English
The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
scientific article

    Statements

    The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (English)
    0 references
    0 references
    0 references
    16 June 2006
    0 references
    total coloring
    0 references

    Identifiers