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
来源：
JOURNAL OF GRAPH THEORY | 1999年 / 32卷 / 03期
关键词：
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
相关论文
共 50 条
  • [21] On strong edge-coloring of graphs with maximum degree 5
    Lu, Jian
    Liu, Huiqing
    Hu, Xiaolan
    DISCRETE APPLIED MATHEMATICS, 2024, 344 : 120 - 128
  • [22] Injective edge coloring of sparse graphs with maximum degree 5
    Junlei Zhu
    Yuehua Bu
    Hongguo Zhu
    Journal of Combinatorial Optimization, 2023, 45
  • [23] Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
    Wang, Yingqian
    Lu, Huajing
    Chen, Ming
    DISCRETE MATHEMATICS, 2010, 310 (01) : 147 - 158
  • [24] Edge Rupture Degree of Graphs
    Li, Yinkui
    Du, Mingzhe
    Li, Hongyan
    Wang, Xiaolin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (08) : 993 - 1006
  • [25] On strong edge-coloring of graphs with maximum degree 4
    Lv, Jian-Bo
    Li, Xiangwen
    Yu, Gexin
    DISCRETE APPLIED MATHEMATICS, 2018, 235 : 142 - 153
  • [26] Representing edge intersection graphs of paths on degree 4 trees
    Golumbic, Martin Charles
    Lipshteyn, Marina
    Stern, Michal
    DISCRETE MATHEMATICS, 2008, 308 (08) : 1381 - 1387
  • [27] A sufficient condition for planar graphs to be acyclically 5-choosable
    Chen, Min
    Raspaud, Andre
    JOURNAL OF GRAPH THEORY, 2012, 70 (02) : 135 - 151
  • [28] 2-connected chordal graphs and line graphs are (1,5)-choosable
    Wong, Tsai-Lien
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
  • [29] On 3-choosable planar graphs of girth at least 4
    Li, Xiangwen
    DISCRETE MATHEMATICS, 2009, 309 (08) : 2424 - 2431
  • [30] On chromatic-choosable graphs
    Ohba, K
    JOURNAL OF GRAPH THEORY, 2002, 40 (02) : 130 - 135
12345