|
|||||
|
|
Upper Bounds on List Star Chromatic Index of Sparse Graphs |
|
| Authors: | Jia Ao Li Katie Horacek Rong Luo Zheng Ke Miao |
| Affiliation: | 1.School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, P. R. China;2.Department of Mathematics, Frostburg State University, Frostburg, MD 21532, USA;3.Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA;4.School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou 221116, P. R. China |
| Abstract: | A star k-edge-coloring is a proper k-edge-coloring such that every connected bicolored subgraph is a path of length at most 3. The star chromatic index $$\ |
| Keywords: | Star edge coloring list edge coloring maximum average degree |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《数学学报(英文版)》下载全文 | |
