Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

DOI10.1007/978-3-540-70666-3_6MaRDI QIDQ3595426zbMATH OpenOpenAlexFDO

Authors Lin Hu, Xueliang Li

Publication date 28 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Abstract: This paper has been withdrawn by the author(s), due an error in the proof.

Recommendations

• Heterochromatic matchings in edge-colored graphs
• Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)
• scientific article; zbMATH DE number 5914945
• Color degree and heterochromatic matchings in edge-colored bipartite graphs
• Rainbow matchings in properly colored bipartite graphs

Cited in

(6)

• Heterochromatic matchings in edge-colored graphs
• Matchings with few colors in colored complete graphs and hypergraphs
• Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)
• scientific article; zbMATH DE number 5914945 (Why is no real title available?)
• Color degree and heterochromatic matchings in edge-colored bipartite graphs
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs

This page was built for publication: Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

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