Acyclic improper choosability of subcubic graphs
type: Item
instance of: scholarly article
title: Acyclic improper choosability of subcubic graphs
zbMATH Open document ID: 1428.05100
author: Min Chen
author: André Raspaud
published in: Applied Mathematics and Computation
publication date: 2019-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7138601
zbMATH Keywords: improper coloring
zbMATH Keywords: acyclic coloring
zbMATH Keywords: acyclic improper choosability
zbMATH Keywords: subcubic graphs
MaRDI profile type: Publication
full work available at URL: j.amc.2019.03.027
OpenAlex ID: W2933314181
cites work: Acyclic dominating partitions
cites work: Acrylic improper colorings of graphs
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Planar graphs are 1-relaxed, 4-choosable
cites work: On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
cites work: A note on list improper coloring of plane graphs
cites work: Q4230860
cites work: Acyclic improper choosability of graphs
cites work: Q3922703
cites work: Acyclic colorings of planar graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Improper choosability of graphs and maximum average degree
cites work: A note on list improper coloring planar graphs
cites work: List Improper Colourings of Planar Graphs
cites work: A Grötzsch-Type Theorem for List Colourings with Impropriety One
cites work: Every planar graph is 5-choosable
cites work: Q4135588
cites work: List colourings of planar graphs
cites work: Improper Choosability of Planar Graphs without 4-Cycles
cites work: Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
cites work: A \((3,1)^*\)-choosable theorem on toroidal graphs
DOI: 10.1016/J.AMC.2019.03.027
description: scientific article; zbMATH DE number 7138601