Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/jgt.22402 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
list star chromatic index,list star edge-coloring,star chromatic index,subcubic graph | Graph theory,Edge coloring,Discrete mathematics,Graph,Combinatorics,Mathematics,A* search algorithm | Journal |
Volume | Issue | ISSN |
90.0 | 3.0 | 0364-9024 |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Borut Luzar | 1 | 42 | 10.86 |
| Martina Mockovciaková | 2 | 19 | 5.04 |
| Roman Soták | 3 | 128 | 24.06 |