![](/img/cover-not-exists.png)
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Hervé Hocquard, Mickaël MontassierVolume:
109
Year:
2009
Language:
english
Pages:
4
DOI:
10.1016/j.ipl.2009.08.004
File:
PDF, 165 KB
english, 2009