共 50 条
Graphs of degree 4 are 5-edge-choosable
被引:1
|作者:
Juvan, M
[1
]
Mohar, B
[1
]
Skrekovski, R
[1
]
机构:
[1] Univ Ljubljana, Dept Math, Ljubljana 1111, Slovenia
关键词:
graph;
edge coloring;
list coloring;
D O I:
10.1002/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
It is shown that every simple graph with maximal degree 4 is 5-edge-choosable. (C) 1999 John Wiley & Sons, Inc.
引用
收藏
页码:250 / 264
页数:15
相关论文