"Every planar graph without cycles of lengths 4 to 12 is acyclically ..."

Hervé Hocquard, Mickaël Montassier (2009)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2009.08.004

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/HocquardM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/HocquardM09
Hervé Hocquard, Mickaël Montassier:
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable. Inf. Process. Lett. 109(21-22): 1193-1196 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.