Skip to search formSkip to main contentSkip to account menu

Rainbow matching

In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Edge coloringGraph theoryMatching (graph theory)Michael Garey

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs
A graph $G$ whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching $M$ that… 
2015
2015
Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
2014
2014
Rainbow matchings and transversals
We show that there exists a bipartite graph containing n matchings of sizes mi n satisfying ∑ i mi = n 2 + n/2 − 1, such that the… 
2013
2013
A rainbow matching in a bipartite graph
A recent conjecture of Aharoni, Charbit and Howard states that $n$ matchings, each of size $n+1$, in a bipartite graph have a… 
2012
2012
Rainbow matchings and partial transversals of Latin squares
In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each… 
2012
2012
Toward Efficient Channel Hopping for Communication Rendezvous in Dynamic Spectrum Access Networks
—We present ETCH, efficient channel hopping based MAC-layer protocols for communication rendezvous in Dynamic Spectrum Access… 
2011
2011
Rainbow Matchings in Properly Edge Colored Graphs
Let $G$ be a properly edge colored graph. A rainbow matching of $G$ is a matching in which no two edges have the same color. Let… 
2011
2011
Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs
A rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a… 
2011
2011
A note on rainbow matchings in properly edge-coloured graphs
  • A. Lo
  • 2011
  • Corpus ID: 115948792
A rainbow matching in an edge-coloured graph is a matching such that its edges have distinct colours. We show that every properly… 
2010
2010
Rainbow Matching in Edge-Colored Graphs
A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex $v$ is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)