"Planar graphs without intersecting 5-cycles are 4-choosable."

Daiqiang Hu, Jian-Liang Wu (2017)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2017.03.012

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/HuW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/HuW17
Daiqiang Hu, Jian-Liang Wu:
Planar graphs without intersecting 5-cycles are 4-choosable. Discret. Math. 340(8): 1788-1792 (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.