Every toroidal graph is acyclically 8-choosable

DOI10.1007/S10114-013-1497-5zbMATH Open1283.05100OpenAlexW2124561565MaRDI QIDQ2440482FDOQ2440482

Authors: Jianfeng Hou, Guizhen Liu 

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

Recommendations

• scientific article; zbMATH DE number 6007732
• Acyclic 4-choosability of planar graphs
• Planar graphs without 4-cycles are acyclically 6-choosable
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• Acyclic 5-choosability of planar graphs without small cycles

zbMATH Keywords

choosabilitytoroidal graphacyclic coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• List colourings of planar graphs
• Dirac's map-color theorem for choosability
• Acyclic colouring of 1-planar graphs
• 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
• Title not available (Why is that?)
• On the acyclic choosability of graphs

Cited In (6)

• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)