Rainbow Matchings in Properly Colored Bipartite Graphs

Guanghui Wang; Guizhen Liu

doi:10.4236/ojdm.2012.22011

ScienceGate Book Chapters

JOURNAL ARTICLE

Rainbow Matchings in Properly Colored Bipartite Graphs

Guanghui Wang Guizhen Liu

Year: 2012 Journal: Open Journal of Discrete Mathematics Vol: 02 (02)Pages: 62-64 Publisher: Scientific Research Publishing

DOI: 10.4236/ojdm.2012.22011

Get Full-Text PDF Get Analytical Report

Abstract

Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that if , then G has a rainbow coloring of size at least .

Keywords:

Rainbow Bipartite graph Colored Combinatorics Mathematics Matching (statistics) Edge coloring Graph Discrete mathematics Line graph Graph power Physics Optics

Metrics

Cited By

0.33

FWCI (Field Weighted Citation Impact)

Refs

0.60

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Rainbow Matchings in Properly Colored Bipartite Graphs

Abstract

Metrics

Citation History

Topics

Related Documents

Rainbow Matchings in Properly Edge Colored Graphs

Existence of rainbow matchings in properly edge-colored graphs

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs

Rainbow Matchings in Properly-Colored Hypergraphs

Rainbow Matchings in Properly Colored Multigraphs