Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589): Difference between revisions

@@ 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.1016/j.ejc.2014.08.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2055259450
@@ Property / OpenAlex ID: W2055259450 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering planar graphs with forests
@@ Property / cites work: Covering planar graphs with forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ Property / cites work @@
+Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
+Normal rank
@@ Property / cites work @@
+A step towards the strong version of Havel's three color conjecture
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth 9 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be 3-colorable
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+A note on list improper coloring of plane graphs
@@ Property / cites work: A note on list improper coloring of plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230860
@@ Property / cites work: Q4230860 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-partitions of planar graphs and their game coloring numbers
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
+Normal rank
@@ Property / cites work @@
+A note on list improper coloring planar graphs
@@ Property / cites work: A note on list improper coloring planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests
@@ Property / cites work: Decomposing a graph into forests / 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 @@
+A note on the three color problem
@@ Property / cites work: A note on the three color problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Grötzsch-Type Theorem for List Colourings with Impropriety One
+Normal rank
@@ Property / cites work @@
+List Improper Colourings of Planar Graphs
@@ Property / cites work: List Improper Colourings of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+没有4至6-圈的平面图是(1,0,0)-可染的
@@ Property / cites work: 没有4至6-圈的平面图是(1,0,0)-可染的 / rank @@
+Normal rank
@@ Property / cites work @@
+Improper Choosability of Planar Graphs without 4-Cycles
+Normal rank
@@ Property / cites work @@
+Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
+Normal rank
@@ Property / cites work @@
+Improper colorability of planar graphs without prescribed short cycles
+Normal rank
@@ Property / cites work @@
+\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth at least 8 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+A 3-color theorem on plane graphs without 5-circuits
+Normal rank
@@ Property / cites work @@
+On $(3,1)^*$-Coloring of Plane Graphs
@@ Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank @@
+Normal rank