Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158): Difference between revisions

@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+Some counterexamples associated with the three-color problem
+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 @@
+Q4374713
@@ Property / cites work: Q4374713 / 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 @@
+Q4811813
@@ Property / cites work: Q4811813 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be 3-colorable
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture of B. Grünbaum
@@ Property / cites work: On a conjecture of B. Grünbaum / rank @@
+Normal rank
@@ Property / cites work @@
+A relaxation of Havel's 3-color problem
@@ Property / cites work: A relaxation of Havel's 3-color problem / 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 @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+A 3-color theorem on plane graphs without 5-circuits
+Normal rank