Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500): Difference between revisions

@@ Property / author @@
-Mária Maceková
@@ Property / author: Mária Maceková / rank @@
-Normal rank
@@ Property / author @@
+Mária Maceková
@@ Property / author: Mária Maceková / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2954828522
@@ Property / OpenAlex ID: W2954828522 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09347
@@ Property / arXiv ID: 1809.09347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065568
@@ Property / cites work: Q4065568 / rank @@
+Normal rank
@@ Property / cites work @@
+Some counterexamples associated with the three-color problem
+Normal rank
@@ Property / cites work @@
+Colorings and orientations of graphs
@@ Property / cites work: Colorings and orientations of graphs / rank @@
+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 cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Short proofs of coloring theorems on planar graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs without adjacent cycles of length at most seven are 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 @@
+Zig-zag facial total-coloring of plane graphs
@@ Property / cites work: Zig-zag facial total-coloring of plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414492
@@ Property / cites work: Q4414492 / rank @@
+Normal rank
@@ Property / cites work @@
+-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
+Normal rank
@@ Property / cites work @@
+Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
+Normal rank
@@ Property / cites work @@
+Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
+Normal rank
@@ Property / cites work @@
+Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
+Normal rank
@@ Property / cites work @@
+Colorability of planar graphs with isolated nontriangular faces
+Normal rank
@@ Property / cites work @@
+List edge colourings of some 1-factorable multigraphs
+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 @@
+Grötzsch's theorem on 3-colorings
@@ Property / cites work: Grötzsch's theorem on 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture of B. Grünbaum
@@ Property / cites work: On a conjecture of B. Grünbaum / rank @@
+Normal rank
@@ Property / cites work @@
+Three colorability characterized by shrinking of locally connected subgraphs into triangles
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs of girth 5
@@ Property / cites work: 3-list-coloring planar graphs of girth 5 / rank @@
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A not 3-choosable planar graph without 3-cycles
@@ Property / cites work: A not 3-choosable planar graph without 3-cycles / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127577521
@@ Property / Wikidata QID: Q127577521 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2324500