Colouring planar graphs with bounded monochromatic components
Publication:2182229
DOI10.33048/SEMI.2020.17.032zbMath1440.05086OpenAlexW3018799881MaRDI QIDQ2182229
Publication date: 21 May 2020
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2020.17.032
girthplanar graphfractional arboricitymaximum average degreelist colouringforest decompositionclustered colouringdefective colouringnine dragon tree theorem
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- 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
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- List colourings of planar graphs
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposing a graph into forests
- Planar graphs are 1-relaxed, 4-choosable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Every planar graph is 5-choosable
- Bounded size components -- partitions and transversals.
- Partitioning into graphs with only small components
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- A not 3-choosable planar graph without 3-cycles
- List improper colorings of planar graphs with prescribed girth
- Near-colorings: non-colorable graphs and NP-completeness
- Defective 2-colorings of sparse graphs
- Graphs with forbidden subgraphs
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
- 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
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the linear vertex-arboricity of a planar graph
- Graph coloring with no large monochromatic components
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
- Partition of a planar graph with girth 6 into two forests with chain length at most 4
- Improper coloring of graphs on surfaces
- Improper choosability of graphs and maximum average degree
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Colouring planar graphs with bounded monochromatic components
