"Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable."

Seth Nelson, Gexin Yu (2026)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2026.02.040

access: closed

type: Journal Article

metadata version: 2026-04-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/NelsonY26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/NelsonY26
Seth Nelson, Gexin Yu:
Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable. Discret. Appl. Math. 386: 345-364 (2026)

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.