Rainbow matchings in properly edge colored graphs

zbMath1230.05137MaRDI QIDQ640415

Guang-Hui Wang

Publication date: 18 October 2011

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

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p162.html

zbMATH Keywords

triangle-free graphsrainbow matchingsproperly colored graphs

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

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 ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Rainbow tetrahedra in Cayley graphs ⋮ Longest partial transversals in plexes ⋮ Rainbow matchings and cycle-free partial transversals of Latin squares ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ Large rainbow matchings in semi-strong edge-colorings of graphs ⋮ Existence of rainbow matchings in properly edge-colored graphs ⋮ Some rainbow cycles in \(r\)-good edge-colorings ⋮ A note on large rainbow matchings in edge-coloured graphs ⋮ Quadratic vertex kernel for rainbow matching ⋮ Rainbow matchings in strongly edge-colored graphs ⋮ Orthogonal matchings revisited ⋮ Existences of rainbow matchings and rainbow matching covers

This page was built for publication: Rainbow matchings in properly edge colored graphs