Clustered 3-colouring graphs of bounded degree
From MaRDI portal
Publication:5886311
DOI10.1017/S0963548321000213MaRDI QIDQ5886311
David R. Wood, Bartosz Walczak, Louis Esperet, Pat Morin, Vida Dujmović
Publication date: 31 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11721
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items (6)
Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Twin-width II: small classes ⋮ An improved planar graph product structure theorem ⋮ Improved product structure for graphs on surfaces ⋮ The product structure of squaregraphs ⋮ Graph product structure for non-minor-closed classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. III. Planar tree-width
- On tree-partition-width
- S-functions for graphs
- A partial k-arboretum of graphs with bounded treewidth
- The four-colour theorem
- Bounded size components -- partitions and transversals.
- Partitioning into graphs with only small components
- Graph minors. XVI: Excluding a non-planar graph
- Diameter and treewidth in minor-closed graph families
- Track layouts, layered path decompositions, and leveled planarity
- Defective and clustered graph colouring
- Graph minor hierarchies
- Clustered colouring in minor-closed classes
- Layered separators in minor-closed graph classes with applications
- Clustered variants of Hajós' conjecture
- Stack and Queue Layouts via Layered Separators
- Parameters Tied to Treewidth
- Map graphs
- A Relative of Hadwiger's Conjecture
- Graph coloring with no large monochromatic components
- Large Monochromatic Components in Two-Colored Grids
- Graph minors. II. Algorithmic aspects of tree-width
- A Separator Theorem for Planar Graphs
- The Game of Hex and the Brouwer Fixed-Point Theorem
- A Separator Theorem for Nonplanar Graphs
- Every Planar Map is Four Colorable
- Approximation algorithms for NP-complete problems on planar graphs
- Improper colourings inspired by Hadwiger's conjecture
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
- Some results on tree decomposition of graphs
- Adjacency Labelling for Planar Graphs (and Beyond)
- Planar graphs have bounded nonrepetitive chromatic number
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Planar Graphs Have Bounded Queue-Number
- Shorter Labeling Schemes for Planar Graphs
- Improved bounds for centered colorings
- Better bounds for poset dimension and boxicity
- Improper colouring of graphs with no odd clique minor
- Defective and clustered choosability of sparse graphs
- Structure of Graphs with Locally Restricted Crossings
- Improper coloring of graphs on surfaces
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
- Islands in Graphs on Surfaces
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components
This page was built for publication: Clustered 3-colouring graphs of bounded degree
