On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735): Difference between revisions

@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Planar graphs are 1-relaxed, 4-choosable
@@ Property / cites work: Planar graphs are 1-relaxed, 4-choosable / 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 @@
+Q4230860
@@ Property / cites work: Q4230860 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / 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 @@
+List Improper Colourings of Planar Graphs
@@ Property / cites work: List Improper Colourings of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Grötzsch-Type Theorem for List Colourings with Impropriety One
+Normal rank
@@ Property / cites work @@
+List improper colorings of planar graphs with prescribed girth
+Normal rank
@@ Property / cites work @@
+Q3115277
@@ Property / cites work: Q3115277 / rank @@
+Normal rank
@@ Property / cites work @@
+Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
+Normal rank
@@ Property / cites work @@
+A \((3,1)^*\)-choosable theorem on toroidal graphs
+Normal rank