Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\)

DOI10.37236/8239zbMath1444.05057arXiv1810.05324OpenAlexW3045784041MaRDI QIDQ783076

Jürgen Kritschgau

Publication date: 30 July 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.05324

zbMATH Keywords

edge colored graphs with given total color degree

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 (1)

Large rainbow matchings in edge-colored graphs with given average color degree

Cites Work

• Rainbow matchings of size \(\delta(G)\) 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
• Transversals of latin squares and their generalizations
• Existence of rainbow matchings in properly edge-colored graphs
• Rainbow matchings and cycle-free partial transversals of Latin squares
• Large Rainbow Matchings in Edge-Coloured Graphs

This page was built for publication: Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\)