Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Work
Year: 2009
Type: article
Source: Information Processing Letters
Authors Hervé Hocquard, Mickaël Montassier
Cites: 14
Cited by: 13
Related to: 10
FWCI: 3.309
Citation percentile (by year/subfield): 61.85
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green