Acyclic improper choosability of graphs
From MaRDI portal
Publication:3439591
DOI10.1016/j.endm.2007.01.037zbMath1291.05060MaRDI QIDQ3439591
Louis 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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Acyclic improper colourings of graphs with bounded maximum degree
- Every planar graph is 5-choosable
- Defective choosability results for outerplanar and related graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- List Improper Colourings of Planar Graphs
- Defective choosability of graphs with no edge-plus-independent-set minor
- Acyclic list 7‐coloring of planar graphs
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science