Planar graphs with cycles of length neither 4 nor 6 are $(2,0,0)$-colorable (Q2444905): 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.ipl.2013.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2051849612
@@ Property / OpenAlex ID: W2051849612 / 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 @@
+Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+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 @@
+Q4230860
@@ Property / cites work: Q4230860 / rank @@
+Normal rank
@@ Property / cites work @@
+The 3-colorability of planar graphs without cycles of length 4, 6 and 9
+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 @@
+List Improper Colourings of Planar Graphs
@@ Property / cites work: List Improper Colourings of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Grötzsch-Type Theorem for List Colourings with Impropriety One
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without 4, 6, 8-cycles are 3-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
+Normal rank
@@ Property / cites work @@
+Improper colorability of planar graphs with cycles of length neither 4 nor 6
+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

Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905): Difference between revisions

Latest revision as of 15:17, 7 July 2024

Statements

Sitelinks

Mathematics(1 entry)