Maximum transversal in partial Latin squares and rainbow matchings

DOI10.1016/j.dam.2006.08.002zbMath1161.05017OpenAlexW2021366112MaRDI QIDQ869577

Manouchehr Zaker

Publication date: 8 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.08.002

zbMATH Keywords

Latin squaresindependent setsrainbow matchings\(\mathcal{NP}\)-complete

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Integrality gaps for colorful matchings ⋮ Latin squares with no small odd plexes

Cites Work

• Transversals of latin squares and their generalizations
• Coloured matchings in bipartite graphs
• A generalization of transversals for Latin squares
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum transversal in partial Latin squares and rainbow matchings