Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609): Difference between revisions

@@ 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 @@
+Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
+Normal rank
@@ Property / cites work @@
+(1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface
+Normal rank
@@ Property / cites work @@
+Planar graphs with girth at least 5 are \((3, 5)\)-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs with girth at least 5 are \((3, 4)\)-colorable
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Q4230860
@@ Property / cites work: Q4230860 / rank @@
+Normal rank
@@ Property / cites work @@
+Improper choosability of graphs and maximum average degree
+Normal rank
@@ Property / cites work @@
+Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
+Normal rank
@@ Property / cites work @@
+Near-colorings: non-colorable graphs and NP-completeness
+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 @@
+List improper colorings of planar graphs with prescribed girth
+Normal rank
@@ Property / cites work @@
+Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
+Normal rank