Every toroidal graph is acyclically 8-choosable
From MaRDI portal
Publication:2440482
DOI10.1007/s10114-013-1497-5zbMath1283.05100MaRDI QIDQ2440482
Publication date: 18 March 2014
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-013-1497-5
Related Items
Unnamed Item, Construction of acyclically 4-colourable planar triangulations with minimum degree 4, Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
Cites Work
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- Every planar graph is 5-choosable
- Acyclic 5-choosability of planar graphs without small cycles
- Planar graphs without 4-cycles are acyclically 6-choosable
- Acyclic list 7‐coloring of planar graphs
- Dirac's map-color theorem for choosability
- On the acyclic choosability of graphs
- Acyclic colorings of planar graphs
- Acyclic colouring of 1-planar graphs