Every planar graph with cycles of length neither 4 nor 5 is $(1,1,0)$-colorable (Q489724): Difference between revisions

@@ Property / author @@
+Zheng-Ke Miao
@@ Property / author: Zheng-Ke Miao / 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.1007/s10878-012-9586-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2011909118
@@ Property / OpenAlex ID: W2011909118 / rank @@
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Q4230860
@@ Property / cites work: Q4230860 / rank @@
+Normal rank
@@ Property / cites work @@
+List Improper Colourings of Planar Graphs
@@ Property / cites work: List Improper Colourings of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+On $(3,1)^*$-Coloring of Plane Graphs
@@ Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank @@
+Normal rank

Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions