Coloured matchings in bipartite graphs
From MaRDI portal
Publication:1357740
DOI10.1016/S0012-365X(96)00115-XzbMath0880.05070MaRDI QIDQ1357740
Publication date: 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
A weighted perfect matching with constraints on weights of its parts, Maximum transversal in partial Latin squares and rainbow matchings, On complexity of special maximum matchings constructing, The labeled perfect matching in bipartite graphs, Bottleneck subset-type restricted matching problems, Algorithms and complexity for a class of combinatorial optimization problems with labelling, Maximum weight edge-constrained matchings, A note on the hardness results for the labeled perfect matching problems in bipartite graphs
Cites Work