Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068): Difference between revisions

@@ Property / DOI @@
-.3934/math.2021593
@@ Property / DOI: 10.3934/math.2021593 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / 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 4, 6, 8-cycles are 3-colorable
+Normal rank
@@ Property / cites work @@
+Planar graphs with girth at least 5 are \((3, 4)\)-colorable
+Normal rank
@@ Property / cites work @@
+Relaxed equitable colorings of planar graphs with girth at least 8
+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 @@
+-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
+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 @@
+Every planar graph without adjacent cycles of length at most 8 is 3-choosable
+Normal rank
@@ Property / cites work @@
+The asymptotic behavior of the correspondence chromatic number
+Normal rank
@@ Property / cites work @@
+Sharp Dirac's theorem for DP‐critical graphs
@@ Property / cites work: Sharp Dirac's theorem for DP‐critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+DP-colorings of graphs with high chromatic number
@@ Property / cites work: DP-colorings of graphs with high chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+On DP-coloring of graphs and multigraphs
@@ Property / cites work: On DP-coloring of graphs and multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
+Normal rank
@@ Property / cites work @@
+DP-3-coloring of some planar graphs
@@ Property / cites work: DP-3-coloring of some planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
+Normal rank
@@ Property / cites work @@
+A sufficient condition for DP-4-colorability
@@ Property / cites work: A sufficient condition for DP-4-colorability / rank @@
+Normal rank
@@ Property / cites work @@
+DP-4-colorability of two classes of planar graphs
@@ Property / cites work: DP-4-colorability of two classes of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+DP-4-colorability of planar graphs without adjacent cycles of given length
+Normal rank
@@ Property / DOI @@
+.3934/MATH.2021593
@@ Property / DOI: 10.3934/MATH.2021593 / rank @@
+Normal rank