Acyclic improper list coloring of graphs

DOI10.16218/J.ISSN.1001-5051.2020.01.006MaRDI QIDQ5115252zbMATH OpenFDO

Authors Chunmiao Li, Min Chen

Publication date 12 August 2020

Full work available at URL https://doi.org/10.16218/J.ISSN.1001-5051.2020.01.006

zbMATH Keywords

acyclic improper coloringimproper coloringmaximum degreeregular graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Acyclic improper choosability of subcubic graphs
• Acyclic improper choosability of graphs
• scientific article; zbMATH DE number 1341902
• On the acyclic choosability of graphs
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6

Cited in

(6)

• Acyclic improper choosability of subcubic graphs
• Acyclic improper choosability of graphs
• List Improper Colourings of Planar Graphs
• scientific article; zbMATH DE number 1341902 (Why is no real title available?)
• scientific article; zbMATH DE number 1146231 (Why is no real title available?)
• Acyclic improper colourings of graphs with bounded maximum degree

This page was built for publication: Acyclic improper list coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115252)