Acyclic improper choosability of graphs
From MaRDI portal
Recommendations
Cites work
- Acrylic improper colorings of graphs
- Acyclic improper colourings of graphs with bounded maximum degree
- Acyclic list 7‐coloring of planar graphs
- Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation (extended abstract)
- Defective choosability of graphs with no edge-plus-independent-set minor
- Defective choosability results for outerplanar and related graphs
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Every planar graph is 5-choosable
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- List colourings of planar graphs
- List Improper Colourings of Planar Graphs
Cited in
(7)- Acyclic improper choosability of subcubic graphs
- Negative results on acyclic improper colorings
- On improperly chromatic-choosable graphs
- Acyclic improper list coloring of graphs
- On the acyclic choosability of graphs
- Improper choosability of graphs and maximum average degree
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Acyclic improper choosability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439591)