Name
Abstract | ||
|---|---|---|
Motivated from optimal channel assignment in optical networks, the list edge (and total) coloring are studied in this paper. In a special case of planar graphs, we determined the list edge (and total) coloring number. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10878-018-00376-9 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Choosability, Planar graph, Intersecting, Chordal | Combinatorics,Chordal graph,Communication channel,List edge-coloring,Mathematics,Planar graph,Special case | Journal |
Volume | Issue | ISSN |
38.0 | 1.0 | 1573-2886 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui-Juan Wang | 1 | 43 | 10.27 |
| Panos M. Pardalos | 2 | 141 | 19.60 |
| Bin Liu | 3 | 88 | 11.12 |