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:
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rosta, Vera (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ghebleh, Mohammad, Kral', Daniel, Norine, Serguei, Thomas, Robin (2006)
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:
Sylwia Cichacz, Jakub Przybyło (2010)
Discussiones Mathematicae Graph Theory
Similarity:
In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct,...
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eric Andrews, Laars Helenius, Daniel Johnston, Jonathon VerWys, Ping Zhang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring. The minimum k for which G has a twin edge k-coloring is called the twin chromatic index of G. Among the results presented are formulas for the twin chromatic index of each complete graph and each complete bipartite graph
Elliot Krop, Irina Krop (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás. We show that [...] , slightly improving the bound of Axenovich. We make small improvements on bounds of Erdös and Gyárfás by showing [...] and for all even n ≢ 1(mod 3), f(n, 4, 5) ≤ n− 1. For a complete bipartite graph G= Kn,n, we show an n-color construction to color...
Yuehua Bu, Ko-Wei Lih, Weifan Wang (2011)
Discussiones Mathematicae Graph Theory
Similarity:
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu,...
Walter, Manfred (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dvořák, Zdeněk, Kára, Jan, Král', Daniel, Pangrác, Ondřej (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: