Acyclic improper choosability of graphs

DOI10.1016/j.endm.2007.01.037zbMath1291.05060OpenAlexW2004217287MaRDI QIDQ3439591

Alexandre Pinlou, Louis Esperet

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

zbMATH Keywords

outerplanar graphscubic graphschoosabilityacyclic coloringimproper coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Acyclic improper choosability of subcubic graphs

Cites Work

• 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 coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Acrylic improper colorings of 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

This page was built for publication: Acyclic improper choosability of graphs