Colouring planar graphs with bounded monochromatic components (Q2182229): Difference between revisions

@@ Property / DOI @@
-.33048/semi.2020.17.032
@@ Property / DOI: 10.33048/semi.2020.17.032 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.33048/semi.2020.17.032
+Normal rank
@@ Property / OpenAlex ID @@
+W3018799881
@@ Property / OpenAlex ID: W3018799881 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning into graphs with only small components
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
+Normal rank
@@ Property / cites work @@
+List strong linear 2-arboricity of sparse graphs
@@ Property / cites work: List strong linear 2-arboricity of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
+Normal rank
@@ Property / cites work @@
+Defective 2-colorings of sparse graphs
@@ Property / cites work: Defective 2-colorings of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On 1-improper 2-coloring of sparse graphs
@@ Property / cites work: On 1-improper 2-coloring of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with forbidden subgraphs
@@ Property / cites work: Graphs with forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improper coloring of graphs on surfaces
@@ Property / cites work: Improper coloring of graphs on surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs with girth at least 5 are \((3, 5)\)-colorable
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Planar graphs are 1-relaxed, 4-choosable
@@ Property / cites work: Planar graphs are 1-relaxed, 4-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests: the nine dragon tree conjecture is true
+Normal rank
@@ Property / cites work @@
+Splitting a planar graph of girth 5 into two forests with trees of small diameter
+Normal rank
@@ Property / cites work @@
+Partition of a planar graph with girth 6 into two forests with chain length at most 4
+Normal rank
@@ Property / cites work @@
+Improper choosability of graphs and maximum average degree
+Normal rank
@@ Property / cites work @@
+Bounded size components -- partitions and transversals.
+Normal rank
@@ Property / cites work @@
+Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
+Normal rank
@@ Property / cites work @@
+Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Graph coloring with no large monochromatic components
+Normal rank
@@ Property / cites work @@
+Near-colorings: non-colorable graphs and NP-completeness
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests
@@ Property / cites work: Decomposing a graph into forests / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+On the linear vertex-arboricity of a planar graph
@@ Property / cites work: On the linear vertex-arboricity of a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+List improper colorings of planar graphs with prescribed girth
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A not 3-choosable planar graph without 3-cycles
@@ Property / cites work: A not 3-choosable planar graph without 3-cycles / rank @@
+Normal rank
@@ Property / DOI @@
+.33048/SEMI.2020.17.032
@@ Property / DOI: 10.33048/SEMI.2020.17.032 / rank @@
+Normal rank