Acyclic improper choosability of subcubic graphs (Q2009524): Difference between revisions

@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2019.03.027
+Normal rank
@@ Property / OpenAlex ID @@
+W2933314181
@@ Property / OpenAlex ID: W2933314181 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic dominating partitions
@@ Property / cites work: Acyclic dominating partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Acrylic improper colorings of graphs
@@ Property / cites work: Acrylic improper colorings of graphs / rank @@
+Normal rank
@@ 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 @@
+On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
+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 @@
+Acyclic improper choosability of graphs
@@ Property / cites work: Acyclic improper choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Improper choosability of graphs and maximum average degree
+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 @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4135588
@@ Property / cites work: Q4135588 / 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 @@
+Improper Choosability of Planar Graphs without 4-Cycles
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:2009524