A relaxation of Havel's 3-color problem (Q963412): Difference between revisions

@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
-Wei Fan Wang
@@ Property / author: Wei Fan Wang / rank @@
-Normal rank
@@ Property / author @@
-Ying Qian Wang
@@ Property / author: Ying Qian Wang / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ Property / author @@
+Wei Fan Wang
@@ Property / author: Wei Fan Wang / rank @@
+Normal rank
@@ Property / author @@
+Ying Qian Wang
@@ Property / author: Ying Qian Wang / 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.ipl.2008.02.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2062686295
@@ Property / OpenAlex ID: W2062686295 / rank @@
+Normal rank
@@ Property / cites work @@
+Some counterexamples associated with the three-color problem
+Normal rank
@@ Property / cites work @@
+Q4865526
@@ Property / cites work: Q4865526 / rank @@
+Normal rank
@@ Property / cites work @@
+Bordeaux 3-color conjecture and 3-choosability
@@ Property / cites work: Bordeaux 3-color conjecture and 3-choosability / rank @@
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs of girth 5
@@ Property / cites work: 3-list-coloring planar graphs of girth 5 / 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