$(1,0,0)$-colorability of planar graphs without prescribed short cycles (Q498436): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-013-9653-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2053644263
@@ Property / OpenAlex ID: W2053644263 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
+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 @@
+Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
+Normal rank
@@ Property / cites work @@
+A Relaxation of Steinberg's Conjecture
@@ Property / cites work: A Relaxation of Steinberg's Conjecture / 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 @@
+On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
+Normal rank
@@ Property / cites work @@
+Planar graphs without 4-,5- and 8-cycles are 3-colorable
+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, 5, 8, or 9 are 3-choosable
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
+Normal rank
@@ Property / cites work @@
+Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
+Normal rank
@@ Property / cites work @@
+Every planar graph with cycles of length neither 4 nor 5 is \((1,1,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-colorable plane graphs without 5- and 7-cycles
+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 @@
+Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
+Normal rank

\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436): Difference between revisions

Latest revision as of 20:31, 10 July 2024

Statements

Sitelinks

Mathematics(1 entry)