Maximum heterochromatic matchings in complete bipartite graph K_n,m and complete graph K₂n

zbMATH Open1244.05178MaRDI QIDQ2892425FDOQ2892425

Lin Hu

Publication date: 18 June 2012

Published in: Far East Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/6185.htm

zbMATH Keywords

edge-colored graphcomplete graphcomplete bipartite graphheterochromatic matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

   Recommendations

• Title not available (Why is that?) 👍 👎
• \(M_2\)-edge coloring and maximum matching of graphs 👍 👎
• Maximum matching of given weight in complete and complete bipartite graphs 👍 👎
• Color degree and heterochromatic matchings in edge-colored bipartite graphs 👍 👎
• Maximal matching and edge domination in complete multipartite graphs 👍 👎
• On maximum induced matchings in bipartite graphs 👍 👎
• Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs 👍 👎
• Heterochromatic matchings in edge-colored graphs 👍 👎
• Bicolored matchings in some classes of graphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\)

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