"Every nice graph is (1, 5)-choosable."

Xuding Zhu (2022)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2022.08.006

access: closed

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jctb/Zhu22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jctb/Zhu22
Xuding Zhu:
Every nice graph is (1, 5)-choosable. J. Comb. Theory B 157: 524-551 (2022)

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.