Possibly Related Publications

The following publications are possibly variants of this publication:

• Algorithm for the Cost Edge-Coloring of TreesXiao Zhou, Takao Nishizeki. cocoon 2001: 288-297 [doi]
• Algorithm for the Cost Edge-Coloring of TreesXiao Zhou, Takao Nishizeki. jco, 8(1):97-108, 2004. [doi]
• A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-TreesShuji Isobe, Xiao Zhou, Takao Nishizeki. criwg 1998: 100-113
• A Linear Algorithm for Finding Total Colorings of Partial k-TreesShuji Isobe, Xiao Zhou, Takao Nishizeki. isaac 1999: 347-356 [doi]
• A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-TreesShuji Isobe, Xiao Zhou, Takao Nishizeki. ijfcs, 10(2):171-194, 1999.
• Minimum Cost Edge-Colorings of Trees Can Be Reduced to MatchingsTakehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki. faw 2010: 274-284 [doi]
• Minimum Cost Edge-Colorings of Trees Can Be Reduced to MatchingsTakehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki. ieicet, 94-D(2):190-195, 2011. [doi]