Author： Caragiannis I. Ferreira A. Kaklamanis C. Pérennes S. Rivano H.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.58, Iss.2, 2010-10, pp. : 516-540
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Randomized path coloring on binary trees
By Auletta V. Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
The permutation-path coloring problem on trees
By Corteel S. Valencia-Pabon M. Gardy D. Barth D. Denise A.
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :