Heterochromatic matchings in edge-colored graphs
From MaRDI portal
Publication:1010874
zbMath1165.05330MaRDI QIDQ1010874
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130286
Related Items
Existence of rainbow matchings in strongly edge-colored graphs ⋮ A note on rainbow matchings in strongly edge-colored graphs ⋮ Large rainbow matchings in edge-colored graphs with given average color degree ⋮ Rainbow edge-coloring and rainbow domination ⋮ A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ Existence of rainbow matchings in properly edge-colored 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\) ⋮ Rainbow matchings in strongly edge-colored graphs ⋮ Orthogonal matchings revisited ⋮ Existences of rainbow matchings and rainbow matching covers ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
