Every planar graph without triangles adjacent to cycles of length 3 or 6 is $( 1 , 1 , 1 )$-colorable (Q2174590): Difference between revisions

@@ Property / cites work @@
+Colorings of plane graphs: a survey
@@ Property / cites work: Colorings of plane graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without triangles adjacent to cycles of length from 3 to 9 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 @@
+A sufficient condition for planar graphs to be 3-colorable
+Normal rank
@@ Property / cites work @@
+Steinberg's conjecture is false
@@ Property / cites work: Steinberg's conjecture is false / rank @@
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Defective coloring revisited
@@ Property / cites work: Defective coloring revisited / rank @@
+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 @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+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 @@
+Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Improper Choosability of Planar Graphs without 4-Cycles
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
+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 without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590): Difference between revisions

Revision as of 10:27, 22 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)