Defective and clustered graph colouring
From MaRDI portal
Publication:1751289
zbMath1391.05119arXiv1803.07694MaRDI QIDQ1751289
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07694
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Related Items (21)
Distance \(r\)-domination number and \(r\)-independence complexes of graphs ⋮ Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Improved bound for improper colourings of graphs with no odd clique minor ⋮ Clustered 3-colouring graphs of bounded degree ⋮ Path choosability of planar graphs ⋮ Higher Independence Complexes of graphs and their homotopy types ⋮ Clustered variants of Hajós' conjecture ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ Defective coloring of hypergraphs ⋮ Sparse critical graphs for defective DP-colorings ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ On generalized choice and coloring numbers ⋮ Improper interval edge colorings of graphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Isomorphic bisections of cubic graphs ⋮ On the \(k\)-component independence number of a tree ⋮ Improper colouring of graphs with no odd clique minor ⋮ Defective and clustered choosability of sparse graphs ⋮ Vizing's and Shannon's theorems for defective edge colouring
This page was built for publication: Defective and clustered graph colouring
