A note on rainbow matchings in strongly edge-colored graphs

DOI10.1016/j.disc.2018.06.019zbMath1393.05206OpenAlexW2884900153WikidataQ129500319 ScholiaQ129500319MaRDI QIDQ1660260

Ta Sheng Tan, Yangyang Cheng, Guang-Hui Wang

Publication date: 15 August 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.019

zbMATH Keywords

Latin squarerainbow matchingRyser conjecturestrongly edge-colored graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Large rainbow matchings in edge-colored graphs with given average color degree ⋮ Rainbow Hamiltonian cycles in strongly edge-colored graphs

Cites Work

• Existence of rainbow matchings in strongly edge-colored graphs
• Color degree and heterochromatic cycles in edge-colored graphs
• Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
• Rainbow matchings in properly edge colored graphs
• A note on large rainbow matchings in edge-coloured graphs
• Rainbow matching in edge-colored graphs
• Heterochromatic matchings in edge-colored graphs
• Rainbow matchings in strongly edge-colored graphs
• Existences of rainbow matchings and rainbow matching covers
• Rainbow matchings in \(r\)-partite \(r\)-graphs
• Rainbow matchings and cycle-free partial transversals of Latin squares
• Large matchings in bipartite graphs have a rainbow matching
• Rainbow matchings and Hamilton cycles in random graphs
• Large Rainbow Matchings in Edge-Coloured Graphs
• On a Generalization of the Ryser-Brualdi-Stein Conjecture