Graphs of degree 4 are 5-edge-choosable

Authors
Juvan, M Mohar, B Skrekovski, R
Citation
M. Juvan et al., Graphs of degree 4 are 5-edge-choosable, J GRAPH TH, 32(3), 1999, pp. 250-264
Citations number
16
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
32
Issue
3
Year of publication
1999
Pages
250 - 264
Database
ISI
SICI code
0364-9024(199911)32:3<250:GOD4A5>2.0.ZU;2-N
Abstract
It is shown that every simple graph with maximal degree 4 is 5-edge-choosab le. (C) 1999 John Wiley & Sons, Inc.