Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
From MaRDI portal
Publication:456311
zbMath1253.05113arXiv1108.2521MaRDI QIDQ456311
Allan Lo, Michael Ferrara, Florian Pfender, Paul S. Wenger, Casey Moffatt, Jennifer Diemunsch
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2521
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Existence of rainbow matchings in strongly edge-colored graphs ⋮ Complexity results for rainbow matchings ⋮ A note on rainbow matchings in strongly edge-colored graphs ⋮ Large rainbow matchings in edge-colored graphs with given average color degree ⋮ Longest partial transversals in plexes ⋮ Rainbow matchings and cycle-free partial transversals of Latin squares ⋮ Large rainbow matchings in semi-strong edge-colorings of graphs ⋮ A note on large rainbow matchings in edge-coloured graphs ⋮ Quadratic vertex kernel for rainbow matching ⋮ Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\) ⋮ Orthogonal matchings revisited ⋮ Existences of rainbow matchings and rainbow matching covers
This page was built for publication: Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
