"Planar graphs have two-coloring number at most 8."

Zdenek Dvorák, Adam Kabela, Tomás Kaiser (2018)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2017.12.003

access: closed

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jct/DvorakKK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/DvorakKK18
Zdenek Dvorák, Adam Kabela, Tomás Kaiser:
Planar graphs have two-coloring number at most 8. J. Comb. Theory B 130: 144-157 (2018)

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.