Path colorings in bipartite graphs

DOI10.1016/j.ejor.2003.05.007zbMath1058.05030OpenAlexW1977357417MaRDI QIDQ1767676

Dominique de Werra

Publication date: 8 March 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.05.007

zbMATH Keywords

Edge coloringBirkhoff-von Neumann theoremPermutation matricesTotal unimodularity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Equitable partitions into matchings and coverings in mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Odd path packings
• A note on SS/TDMA satellite communication
• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
• Variations on the theorem of Birkhoff-von Neumann and extensions
• Paths, chains, and antipaths
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Some Matching Problems for Bipartite Graphs
• How to colour the lines of a bigraph
• 25 pretty graph colouring problems