Heterochromatic matchings in edge-colored graphs

MaRDI QIDQ1010874zbMATH OpenFDO

Authors Hao Li, Guanghui Wang

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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r138.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

edge coloringheterochromatic matching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Color degree and heterochromatic matchings in edge-colored bipartite graphs
• scientific article; zbMATH DE number 5914945
• Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
• Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)
• The heterochromatic cycles in edge-colored graphs

Cited in

(20)

• Existence of rainbow matchings in properly edge-colored graphs
• scientific article; zbMATH DE number 5914945 (Why is no real title available?)
• Orthogonal matchings revisited
• Color degree and heterochromatic matchings in edge-colored bipartite graphs
• A note on rainbow matchings in strongly edge-colored graphs
• A note on large rainbow matchings in edge-coloured graphs
• Matchings with few colors in colored complete graphs and hypergraphs
• Rainbow matchings in strongly edge-colored graphs
• Uniquely restricted matchings and edge colorings
• Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\)
• Existences of rainbow matchings and rainbow matching covers
• Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)
• Rainbow edge-coloring and rainbow domination
• Large rainbow matchings in edge-colored graphs with given average color degree
• Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
• Quadratic vertex kernel for rainbow matching
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two
• Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
• Existence of rainbow matchings in strongly edge-colored graphs
• A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs

This page was built for publication: Heterochromatic matchings in edge-colored graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010874)