Steinberg's conjecture is false (Q345097): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 05C15 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6656176
@@ Property / zbMATH DE Number: 6656176 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+planar graphs
@@ Property / zbMATH Keywords: planar graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph coloring
@@ Property / zbMATH Keywords: graph coloring / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Steinberg conjecture
@@ Property / zbMATH Keywords: Steinberg conjecture / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963985217
@@ Property / OpenAlex ID: W2963985217 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05108
@@ Property / arXiv ID: 1604.05108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000782
@@ Property / cites work: Q4000782 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ 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 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 @@
+Planar graphs without 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 @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the three color problem
@@ Property / cites work: A note on the three color problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+A non-3-choosable planar graph without cycles of length 4 and 5
+Normal rank
@@ Property / cites work @@
+On 3-colorable plane graphs without 5- and 7-cycles
+Normal rank
@@ Property / Wikidata QID @@
+Q105319014
@@ Property / Wikidata QID: Q105319014 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:345097