On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2019.02.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2921364534
@@ Property / OpenAlex ID: W2921364534 / rank @@
+Normal rank
@@ Property / cites work @@
+\((4,2)\)-choosability of planar graphs with forbidden structures
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be (3,1)-choosable
+Normal rank
@@ Property / cites work @@
+On choosability with separation of planar graphs without adjacent short cycles
+Normal rank
@@ Property / cites work @@
+On Choosability with Separation of Planar Graphs with Forbidden Cycles
+Normal rank
@@ Property / cites work @@
+Brooks-type theorems for choosability with separation
+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 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 / cites work @@
+Q2716011
@@ Property / cites work: Q2716011 / rank @@
+Normal rank