Acyclic improper choosability of subcubic graphs

DOI10.1016/j.amc.2019.03.027zbMath1428.05100OpenAlexW2933314181MaRDI QIDQ2009524

Min Chen, Andre Raspaud

Publication date: 29 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.03.027

zbMATH Keywords

acyclic coloringsubcubic graphsimproper coloringacyclic improper choosability

Mathematics Subject Classification ID

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

Related Items (1)

On the vertex partition of planar graphs into forests with bounded degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• A \((3,1)^*\)-choosable theorem on toroidal graphs
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
• Planar graphs are 1-relaxed, 4-choosable
• A note on list improper coloring of plane graphs
• Every planar graph is 5-choosable
• Acyclic improper choosability of graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Acrylic improper colorings of graphs
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• Improper Choosability of Planar Graphs without 4-Cycles
• Improper choosability of graphs and maximum average degree
• Acyclic dominating partitions
• Graph-Theoretic Concepts in Computer Science
• Acyclic colorings of planar graphs
• A note on list improper coloring planar graphs

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