共 50 条
Note on list star edge-coloring of subcubic graphs
被引:13
|作者:
Luzar, Borut
[1
]
Mockovciakova, Martina
[2
]
Sotak, Roman
[3
]
机构:
[1] Fac Informat Studies, Novo Mesto, Slovenia
[2] Univ West Bohemia, European Ctr Excellence NTIS, Plzen, Czech Republic
[3] Pavol Jozef Safarik Univ, Fac Sci, Jesenna 5, Kosice 04154, Slovakia
关键词:
list star chromatic index;
list star edge-coloring;
star chromatic index;
subcubic graph;
D O I:
10.1002/jgt.22402
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7, answering the question of Dvorak et al (J Graph Theory, 72 (2013), 313-326).
引用
收藏
页码:304 / 310
页数:7
相关论文