Clustered colouring of graph classes with bounded treedepth or pathwidth
From MaRDI portal
Recommendations
Cites work
- A note on defective colorings of graphs in surfaces
- A relative of Hadwiger's conjecture
- A relaxed Hadwiger's conjecture for list colorings
- A Weakening of the Odd Hadwiger's Conjecture
- Bounded monochromatic components for random graphs
- Bounded size components -- partitions and transversals.
- Clustered 3-colouring graphs of bounded degree
- Clustered colouring in minor-closed classes
- Clustered variants of Hajós' conjecture
- Colouring planar graphs with three colours and no large monochromatic components
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
- Defective and clustered graph colouring
- Defective coloring revisited
- Defective colouring of graphs excluding a subgraph or minor
- Improper coloring of graphs on surfaces
- Improper colouring of graphs with no odd clique minor
- Improper colourings inspired by Hadwiger's conjecture
- Nonrepetitive colouring via entropy compression
- On fractional fragility rates of graph classes
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components
- Partitioning into graphs with only small components
- Sparsity. Graphs, structures, and algorithms
Cited in
(10)- Clustering as a dual problem to colouring
- Clustered colouring in minor-closed classes
- Tree-depth, subgraph coloring and homomorphism bounds
- Цветовая энергия некоторых кластерных графов
- Clustered 3-colouring graphs of bounded degree
- Defective coloring is perfect for minors
- Clustered coloring of graphs with bounded layered treewidth and bounded degree
- Colouring strong products
- Closure property of contraction-depth of matroids
- Defective and clustered colouring of graphs with given girth
This page was built for publication: Clustered colouring of graph classes with bounded treedepth or pathwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885188)
