Large rainbow matchings in semi-strong edge-colorings of graphs

DOI10.1142/S1793830918500210zbMath1383.05259OpenAlexW2784505015MaRDI QIDQ4634524

No author found.

Publication date: 10 April 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500210

zbMATH Keywords

rainbow matchingproper edge-coloringsemi-strong edge-coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of rainbow matchings in strongly 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
• Transversals of latin squares and their generalizations
• Rainbow matchings in strongly edge-colored graphs
• Rainbow matchings and cycle-free partial transversals of Latin squares
• Large Rainbow Matchings in Edge-Coloured Graphs
• A lower bound for the length of a partial transversal in a Latin square

This page was built for publication: Large rainbow matchings in semi-strong edge-colorings of graphs