Every toroidal graph is acyclically 8-choosable
From MaRDI portal
Publication:2440482
Recommendations
Cites work
- scientific article; zbMATH DE number 3536120 (Why is no real title available?)
- Acyclic 4-choosability of planar graphs withot cycles of specific lengths
- Acyclic 5-choosability of planar graphs without small cycles
- Acyclic colorings of planar graphs
- Acyclic colouring of 1-planar graphs
- Acyclic list 7‐coloring of planar graphs
- Dirac's map-color theorem for choosability
- Every planar graph is 5-choosable
- List colourings of planar graphs
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- On the acyclic choosability of graphs
- Planar graphs without 4-cycles are acyclically 6-choosable
Cited in
(6)- scientific article; zbMATH DE number 6914816 (Why is no real title available?)
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- scientific article; zbMATH DE number 6007732 (Why is no real title available?)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- On the chromatic number of a family of odd hole free graphs
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
This page was built for publication: Every toroidal graph is acyclically 8-choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440482)