Chang-Wu Yu. On the Complexity of the Max-Edge-Coloring Problem with Its Variants. In Bo Chen, Mike Paterson, Guochuan Zhang, editors, Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers. Volume 4614 of Lecture Notes in Computer Science, pages 350-361, Springer, 2007. [doi]
@inproceedings{Yu07:2,
title = {On the Complexity of the Max-Edge-Coloring Problem with Its Variants},
author = {Chang-Wu Yu},
year = {2007},
doi = {10.1007/978-3-540-74450-4_32},
url = {http://dx.doi.org/10.1007/978-3-540-74450-4_32},
researchr = {https://researchr.org/publication/Yu07%3A2},
cites = {0},
citedby = {0},
pages = {350-361},
booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers},
editor = {Bo Chen and Mike Paterson and Guochuan Zhang},
volume = {4614},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74449-8},
}