default search action

combined dblp search
author search
venue search
publication search

ask others

"Graphs of degree 4 are 5-edge-choosable."

Martin Juvan, Bojan Mohar, Riste Skrekovski (1999)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/JuvanMS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/JuvanMS99
Martin Juvan, Bojan Mohar, Riste Skrekovski:
Graphs of degree 4 are 5-edge-choosable. J. Graph Theory 32(3): 250-264 (1999)

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.