Name
Abstract | ||
|---|---|---|
The strong chromatic index of a multigraph is the minimum k such that the edge set can be k -colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gyárfás, Schelp and Tuza, showing that every planar multigraph with maximum degree at most 3 has strong chromatic index at most 9, which is sharp. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ejc.2015.07.002 | European Journal of Combinatorics |
Field | DocType | Volume |
Edge coloring,Discrete mathematics,Colored,Combinatorics,Multigraph,Planar,Degree (graph theory),Conjecture,Mathematics | Journal | 51 |
Issue | ISSN | Citations |
C | European J. Combin. 51 (2016) 380-397 | 6 |
PageRank | References | Authors |
0.70 | 16 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandr V. Kostochka | 1 | 682 | 89.87 |
| Xiaodong Li | 2 | 6 | 0.70 |
| W. Ruksasakchai | 3 | 6 | 0.70 |
| M. Santana | 4 | 6 | 0.70 |
| Tao Wang | 5 | 16 | 5.16 |
| G. Yu | 6 | 6 | 0.70 |