Rainbow matchings and connectedness of coloured graphs
From MaRDI portal
Publication:322269
DOI10.1016/J.ENDM.2015.06.052zbMATH Open1346.05043OpenAlexW2178416479MaRDI QIDQ322269FDOQ322269
Authors: Alexey Pokrovskiy 
Publication date: 14 October 2016
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10112663/
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (14)
- Representation of large matchings in bipartite graphs
- Large rainbow matchings in general graphs
- Rainbow matchings and connectedness of coloured graphs
- On a generalization of the Ryser-Brualdi-Stein conjecture
- Short Proofs of Rainbow Matchings Results
- Spectral radius and rainbow matchings of graphs
- On sets not belonging to algebras and rainbow matchings in graphs
- Large matchings in bipartite graphs have a rainbow matching
- Rainbow paths and large rainbow matchings
- Topological methods for the existence of a rainbow matching
- Rainbow matchings and rainbow connectedness
- An approximate version of a conjecture of Aharoni and Berger
- Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
- New bounds for Ryser’s conjecture and related problems
This page was built for publication: Rainbow matchings and connectedness of coloured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322269)
