Every planar graph without cycles of length 4 or 9 is $(1, 1, 0)$-colorable (Q2359954): Difference between revisions

@@ 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 @@
+Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
+Normal rank
@@ Property / cites work @@
+Steinberg's conjecture is false
@@ Property / cites work: Steinberg's conjecture is false / rank @@
+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 @@
+Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
+Normal rank
@@ Property / cites work @@
+A Relaxation of Steinberg's Conjecture
@@ Property / cites work: A Relaxation of Steinberg's Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs with cycles of length neither 4 nor 7 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 @@
+Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / 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 @@
+On $(3,1)^*$-Coloring of Plane Graphs
@@ Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank @@
+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 @@
+Improper colorability of planar graphs with cycles of length neither 4 nor 6
+Normal rank

Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954): Difference between revisions

Latest revision as of 00:16, 14 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)