Colouring planar graphs with bounded monochromatic components
From MaRDI portal
Recommendations
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Splitting planar graphs of girth 6 into two linear forests with short paths
- List improper colorings of planar graphs with prescribed girth
- Threshold for path colorings of planar graphs
- Planar graphs of girth at least five are square ( + 2)-choosable
Cites work
- A not 3-choosable planar graph without 3-cycles
- Bounded size components -- partitions and transversals.
- Decomposing a graph into forests
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposition of Finite Graphs Into Forests
- Decomposition of sparse graphs into forests and a graph with bounded degree
- Defective 2-colorings of sparse graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Edge-Disjoint Spanning Trees of Finite Graphs
- Every planar graph is 5-choosable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graphs with forbidden subgraphs
- Improper choosability of graphs and maximum average degree
- Improper coloring of graphs on surfaces
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- List colourings of planar graphs
- List improper colorings of planar graphs with prescribed girth
- List strong linear 2-arboricity of sparse graphs
- Near-colorings: non-colorable graphs and NP-completeness
- On 1-improper 2-coloring of sparse graphs
- On the linear vertex-arboricity of a planar graph
- Partition of a planar graph with girth 6 into two forests with chain length at most 4
- Partitioning into graphs with only small components
- Planar graphs are 1-relaxed, 4-choosable
- Planar graphs with girth at least 5 are (3, 5)-colorable
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
Cited in
(4)- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Path partitioning planar graphs with restrictions on short cycles
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
This page was built for publication: Colouring planar graphs with bounded monochromatic components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182229)
