"Every planar graph without adjacent cycles of length at most 8 is 3-choosable."

Runrun Liu, Xiangwen Li (2019)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2019.07.006

access: closed

type: Journal Article

metadata version: 2019-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ejc/LiuL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/LiuL19
Runrun Liu, Xiangwen Li:
Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb. 82 (2019)

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.