Edge coloring of bipartite graphs with constraints

DOI10.1016/S0304-3975(00)00400-XzbMath0989.68104WikidataQ126382619 ScholiaQ126382619MaRDI QIDQ5958313

Ioannis Caragiannis, Pino Persiano, Christos Kaklamanis

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

edge coloringbipartite graphsperfect matchings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Approximate constrained bipartite edge coloring ⋮ On the double total dominator chromatic number of graphs ⋮ A strict strong coloring of trees ⋮ On strict strong coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• On Edge Coloring Bipartite Graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Using euler partitions to edge color bipartite multigraphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Constrained bipartite edge coloring with applications to wavelength routing
• Efficient wavelength routing on directed fiber trees
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Edge coloring of bipartite graphs with constraints