Algorithm for the cost edge-coloring of trees

DOI10.1023/B:JOCO.0000021940.40066.0czbMath1058.05029OpenAlexW2915572347MaRDI QIDQ1768602

Takao Nishizeki, Xiao Zhou

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000021940.40066.0c

zbMATH Keywords

treebipartite graphmatchingcost edge-coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Minimum sum set coloring of trees and line graphs of trees ⋮ Complexity results for minimum sum edge coloring

This page was built for publication: Algorithm for the cost edge-coloring of trees