1 |
B. Luzar, M. Petrusevski, and R. Skrekovski, Odd edge coloring of graphs, Ars Math. Contemp. 9 (2015), no. 2, 277-287.
|
2 |
L. Pyber, Covering the edges of a connected graph by paths, J. Combin. Theory Ser. B 66 (1996), no. 1, 152-159.
DOI
|
3 |
P. Cheilaris, B. Keszegh, and D. Palvolgyi, Unique-maximum and conflict-free coloring for hypergraphs and tree graphs, SIAM J. Discrete Math. 27 (2013), no. 4, 1775-1787.
DOI
|
4 |
I. Fabrici and F. Goring, Unique-maximum coloring of plane graphs, Discuss. Math. Graph Theory 36 (2016), no. 1, 95-102.
DOI
|
5 |
G. Lucarelli, I. Milis, and V. Th. Paschos, On the maximum edge coloring problem (extended abstract), in Approximation and online algorithms, 279-292, Lecture Notes in Comput. Sci., 5426, Springer, Berlin, 2009.
|
6 |
I. Fabrici, S. Jendrol', and M. Vrbjarova, Unique-maximum edge-colouring of plane graphs with respect to faces, Discrete Appl. Math. 185 (2015), 239-243.
DOI
|
7 |
S. Jendrol' and M. Vrbjarova, Maximum edge-colorings of graphs, Discuss. Math. Graph Theory 36 (2016), no. 1, 117-125.
DOI
|