Planar graphs with cycles of length neither 4 nor 7 are $(3,0,0)$-colorable (Q2449160): Difference between revisions

@@ 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.disc.2014.03.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2915227988
@@ Property / OpenAlex ID: W2915227988 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+A note on list improper coloring of plane graphs
@@ Property / cites work: A note on list improper coloring of plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
+Normal rank
@@ Property / cites work @@
+A note on list improper coloring planar graphs
@@ Property / cites work: A note on list improper coloring 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
@@ Property / cites work @@
+Improper colorability of planar graphs with cycles of length neither 4 nor 6
+Normal rank

Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable (Q2449160): Difference between revisions