Contents

Ars Combinatoria

  • Research article

The Heterochromatic Matchings in Edge-Colored Bipartite Graphs

Hao Li1,2, Xueliang Li3, Guizhen Liu4, Guanghui Wang1,4
1Laboratoire de Recherche en Informatique UMR 8623, C.N.R.S.-Université de Paris-sud 91405-Orsay cedex, France
2School of Mathematics and Statistics Lanzhou University 730000 Lanzhou, Gansu, China
3 Center for Combinatorics and LPMC Nankai University Tianjin 300071, China
4School of Mathematics and System Science Shandong University Jinan Shandong 250100, China
  • Published: 31/10/2009

Abstract

Let \((G,C)\) be an edge-colored bipartite graph with bi-partition \((X,Y)\). A heterochromatic matching of \(G\) is such a matching in which no two edges have the same color. Let \(N^c(S)\) denote a maximum color neighborhood of \(S \subseteq V(G)\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang. The Heterochromatic Matchings in Edge-Colored Bipartite Graphs[J], Ars Combinatoria, Volume 093. 129-139. .