Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on defective colorings of graphs in surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded monochromatic components for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper coloring of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective coloring revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered 3-colouring graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relative of Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Planar Graphs With Three Colours and No Large Monochromatic Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size components -- partitions and transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper colouring of graphs with no odd clique minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weakening of the Odd Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed Hadwiger's conjecture for list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning \(H\)-minor free graphs into three subgraphs with no large components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered variants of Hajós' conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colourings with Bounded Monochromatic Components in Graphs of Given Circumference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered colouring in minor-closed classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colouring of graphs excluding a subgraph or minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper colourings inspired by Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective and clustered graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colouring via entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fractional fragility rates of graph classes / rank
 
Normal rank

Latest revision as of 21:09, 31 July 2024

scientific article; zbMATH DE number 7671451
Language Label Description Also known as
English
Clustered colouring of graph classes with bounded treedepth or pathwidth
scientific article; zbMATH DE number 7671451

    Statements

    Clustered colouring of graph classes with bounded treedepth or pathwidth (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2023
    0 references
    0 references
    graph colouring
    0 references
    clustered colouring
    0 references
    minor
    0 references
    treedepth
    0 references
    pathwidth
    0 references
    fractional colouring
    0 references
    0 references