Coloured matchings in bipartite graphs

DOI10.1016/S0012-365X(96)00115-XzbMath0880.05070MaRDI QIDQ1357740

Kathie Cameron

Publication date: 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmbipartite graphsNP-completegood perfect matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Maximum transversal in partial Latin squares and rainbow matchings ⋮ A weighted perfect matching with constraints on weights of its parts ⋮ On complexity of special maximum matchings constructing ⋮ Maximum weight edge-constrained matchings ⋮ A note on the hardness results for the labeled perfect matching problems in bipartite graphs ⋮ Bottleneck subset-type restricted matching problems ⋮ Algorithms and complexity for a class of combinatorial optimization problems with labelling ⋮ The labeled perfect matching in bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Splitting groups of prime order
• Transversals of latin squares and their generalizations
• Some Matching Problems for Bipartite Graphs

This page was built for publication: Coloured matchings in bipartite graphs