Acyclic improper choosability of graphs
From MaRDI portal
Publication:3439591
DOI10.1016/J.ENDM.2007.01.037zbMATH Open1291.05060OpenAlexW2004217287MaRDI QIDQ3439591FDOQ3439591
Authors: L. Esperet, Alexandre Pinlou 
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.037
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Every planar graph is 5-choosable
- Title not available (Why is that?)
- List Improper Colourings of Planar Graphs
- Acrylic improper colorings of graphs
- Acyclic improper colourings of graphs with bounded maximum degree
- List colourings of planar graphs
- Defective coloring revisited
- Acyclic list 7‐coloring of planar graphs
- Graph-Theoretic Concepts in Computer Science
- 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
Cited In (7)
- On the acyclic choosability of graphs
- Acyclic improper choosability of subcubic graphs
- Negative results on acyclic improper colorings
- Graph-Theoretic Concepts in Computer Science
- Improper choosability of graphs and maximum average degree
- Acyclic improper list coloring of graphs
- On improperly chromatic-choosable graphs
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)
