Colouring graphs with bounded generalized colouring number (Q1045038): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with linearly bounded Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple competitive graph coloring algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank

Latest revision as of 06:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Colouring graphs with bounded generalized colouring number
scientific article

    Statements

    Colouring graphs with bounded generalized colouring number (English)
    0 references
    0 references
    15 December 2009
    0 references
    generalized colouring number
    0 references
    tree depth
    0 references
    colouring of graphs
    0 references
    greatest reduced average degree
    0 references

    Identifiers