### Rainbow matching in edge-colored graphs.

LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Axenovich, Maria, Choi, JiHyeok (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Ghebleh, Mohammad, Kral&amp;#039;, Daniel, Norine, Serguei, Thomas, Robin (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Jin, Zemin, Li, Xueliang (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Fujita, Shinya, Kaneko, Atsushi, Schiermeyer, Ingo, Suzuki, Kazuhiro (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Yuster, Raphael (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Aharoni, Ron, Berger, Eli (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Oleg V. Borodin, Anna O. Ivanova (2013)

Discussiones Mathematicae Graph Theory

Similarity:

We prove that every planar graph with maximum degree ∆ is strong edge (2∆−1)-colorable if its girth is at least 40 [...] +1. The bound 2∆−1 is reached at any graph that has two adjacent vertices of degree ∆.

Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Július Czap, Peter Šugerek, Jaroslav Ivančo (2016)

Discussiones Mathematicae Graph Theory

Similarity:

An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G. In this paper we determine 𝒦2(G) for trees, cacti, complete multipartite graphs and graph joins.

Mubayi, Dhruv, Talbot, John (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Mohar, Bojan, Pisanski, Tomaz (1983)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity: