Defective and clustered choosability of sparse graphs
From MaRDI portal
Publication:5222556
DOI10.1017/S0963548319000063zbMath1436.05038arXiv1806.07040OpenAlexW2887773522WikidataQ128056358 ScholiaQ128056358MaRDI QIDQ5222556
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07040
Related Items
Clustered 3-colouring graphs of bounded degree, Clustered variants of Hajós' conjecture, Sparse critical graphs for defective DP-colorings, On 2-defective DP-colorings of sparse graphs, Defective DP-colorings of sparse multigraphs, Defective DP-colorings of sparse simple graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-improper 2-coloring of sparse graphs
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Planar graphs are 1-relaxed, 4-choosable
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- The thickness of graphs: A survey
- Bounded size components -- partitions and transversals.
- Partitioning into graphs with only small components
- Defective and clustered graph colouring
- Variations on Ringel's earth-moon problem
- Maximum average degree and relaxed coloring
- Clustered colouring in minor-closed classes
- Defective colouring of graphs excluding a subgraph or minor
- Defective 2-colorings of sparse graphs
- A Note on Vertex List Colouring
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
- Limits of Near-Coloring of Sparse Graphs
- List strong linear 2-arboricity of sparse graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Defective choosability of graphs in surfaces
- More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number
- Defective coloring revisited
- A Relative of Hadwiger's Conjecture
- Layouts of Expander Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
- Improper colourings inspired by Hadwiger's conjecture
- Improper coloring of graphs on surfaces
- Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
- Improper choosability of graphs and maximum average degree
- Islands in Graphs on Surfaces
