Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2004.11.001
@@ Property / DOI: 10.1016/j.jctb.2004.11.001 / rank @@
-Normal rank
@@ 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.jctb.2004.11.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2033177498
@@ Property / OpenAlex ID: W2033177498 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / 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 @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / 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 / DOI @@
+.1016/J.JCTB.2004.11.001
@@ Property / DOI: 10.1016/J.JCTB.2004.11.001 / rank @@
+Normal rank