Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422): Difference between revisions

@@ Property / author @@
+Alexandr V. Kostochka
@@ Property / author: Alexandr V. Kostochka / 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.disc.2004.10.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2137523248
@@ Property / OpenAlex ID: W2137523248 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065568
@@ Property / cites work: Q4065568 / rank @@
+Normal rank
@@ Property / cites work @@
+Grötzsch's theorem on 3-colorings
@@ Property / cites work: Grötzsch's theorem on 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of planar graph choosability
@@ Property / cites work: The complexity of planar graph choosability / rank @@
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A not 3-choosable planar graph without 3-cycles
@@ Property / cites work: A not 3-choosable planar graph without 3-cycles / rank @@
+Normal rank