Rainbow matchings and connectedness of coloured graphs

DOI10.1016/J.ENDM.2015.06.052zbMath1346.05043OpenAlexW2178416479MaRDI QIDQ322269

Alexey Pokrovskiy

Publication date: 14 October 2016

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10112663/

zbMATH Keywords

connectednessLatin squarestransversalsmatchings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (3)

Rainbow matchings and connectedness of coloured graphs ⋮ On sets not belonging to algebras and rainbow matchings in graphs ⋮ Representation of Large Matchings in Bipartite Graphs

Cites Work

• Rainbow matchings and connectedness of coloured graphs
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Large matchings in bipartite graphs have a rainbow matching
• On a Generalization of the Ryser-Brualdi-Stein Conjecture
• Orthogonal Latin Rectangles

This page was built for publication: Rainbow matchings and connectedness of coloured graphs