Edge coloring of bipartite graphs with constraints
From MaRDI portal
Publication:5958313
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)
68R10: Graph theory (including graph drawing) in computer science
Related Items
On strict strong coloring of graphs, On the double total dominator chromatic number of graphs, A strict strong coloring of trees, Approximate constrained bipartite edge coloring
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