"Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable."

Lifeng Dai, Yingqian Wang, Jinghan Xu (2017)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2017.04.006

access: closed

type: Journal Article

metadata version: 2020-08-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/DaiWX17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/DaiWX17
Lifeng Dai, Yingqian Wang, Jinghan Xu:
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. Discret. Math. 340(9): 2108-2122 (2017)

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.