Generalizing the Ramsey problem through diameter.
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the number of square classes of a field of finite level.”
Generalizing the Ramsey problem through diameter.
On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph.
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Orthogonal colorings of graphs.
Caro, Yair, Yuster, Raphael (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On swell-colored complete graphs.
Ward, C., Szabó, S. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A rainbow -matching in the complete graph with colors.
Fujita, Shinya, Kaneko, Atsushi, Schiermeyer, Ingo, Suzuki, Kazuhiro (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An improvement to Mathon's cyclotomic Ramsey colorings.
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
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...
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:
On multicolor Ramsey number of paths versus cycles.
Omidi, Gholam Reza, Raeisi, Ghaffar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Borodin-Kostochka conjecture for graphs containing a doubly critical edge.
Rabern, Landon (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constructive lower bounds on classical multicolor Ramsey numbers.
Xu, Xiaodong, Xie, Zheng, Exoo, Geoffrey, Radziszowski, Stanisław P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Twin Edge Colorings of Graphs
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
Rainbow -factors.
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: