On 3-colorable planar graphs without short cycles (Q998606): Difference between revisions

@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / 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 without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Three-coloring planar graphs without short cycles
@@ Property / cites work: Three-coloring planar graphs without short cycles / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / 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 @@
+On 3-colorable plane graphs without 5- and 7-cycles
+Normal rank
@@ Property / cites work @@
+On 3-colorable planar graphs without prescribed cycles
+Normal rank
@@ Property / cites work @@
+A note on 3-choosability of planar graphs without certain cycles
+Normal rank