Existence of rainbow matchings in properly edge-colored graphs
From MaRDI portal
Publication:1758120
DOI10.1007/s11464-012-0202-9zbMath1252.05181OpenAlexW2072617750MaRDI QIDQ1758120
Gui Zhen Liu, Jiang-Hua Zhang, Guang-Hui Wang
Publication date: 7 November 2012
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-012-0202-9
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Rainbow matchings and cycle-free partial transversals of Latin squares ⋮ A note on large rainbow matchings in edge-coloured graphs ⋮ Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\) ⋮ A NOTE ON RAINBOW MATCHINGS ⋮ Orthogonal matchings revisited
Cites Work
- Rainbow matchings in properly edge colored graphs
- Rainbow matching in edge-colored graphs
- Heterochromatic matchings in edge-colored graphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Transversals of latin squares and their generalizations
- Large Rainbow Matchings in Edge-Coloured Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Existence of rainbow matchings in properly edge-colored graphs
