default search action

combined dblp search
author search
venue search
publication search

ask others

"Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable."

Yingqian Wang, Huajing Lu, Ming Chen (2010)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2009.08.005

access: open

type: Journal Article

metadata version: 2023-05-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/WangLC10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/WangLC10
Yingqian Wang, Huajing Lu, Ming Chen:
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. Discret. Math. 310(1): 147-158 (2010)

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.