Acyclic choosability of graphs with bounded degree

DOI10.1007/s10114-022-0097-7zbMath1490.05087OpenAlexW4210667012MaRDI QIDQ2119462

Juan Wang, Yunlong Liu, Jin-bo Li, Lian-Ying Miao

Publication date: 29 March 2022

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-022-0097-7

zbMATH Keywords

maximum degreelist colouringacyclic choosabilityacyclic colouring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of graphs with bounded degree
• On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
• On acyclic colorings of planar graphs
• Planar graphs without chordal 6-cycles are 4-choosable
• Acyclic colorings of locally planar graphs
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• Acyclic coloring of graphs with maximum degree at most six
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• Acyclic vertex coloring of graphs of maximum degree six
• Acyclic coloring of graphs with maximum degree 7
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Graphs with maximum degree 5 are acyclically 7-colorable
• Acyclic coloring of graphs
• Acyclic list 7‐coloring of planar graphs
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• On the acyclic choosability of graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Graph-Theoretic Concepts in Computer Science
• Acyclic colorings of planar graphs

This page was built for publication: Acyclic choosability of graphs with bounded degree