Name
Abstract | ||
|---|---|---|
Abstract A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. 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 Dvořak et al. in [Dvořak, Z., B. Mohar, and R. Samal, Star chromatic index , J. Graph Theory 72 (2013), 313–326]. |
Year | Venue | Field |
|---|---|---|
2017 | Electronic Notes in Discrete Mathematics | Graph theory,Discrete mathematics,Edge coloring,Combinatorics,List coloring,Foster graph,Star (graph theory),Friendship graph,Windmill graph,Butterfly graph,Mathematics |
DocType | Volume | Citations |
Journal | 61 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Borut Luzar | 1 | 42 | 10.86 |
| Martina Mockovciaková | 2 | 19 | 5.04 |
| Roman Soták | 3 | 128 | 24.06 |