On multicolor Ramsey number of paths versus cycles.
Omidi, Gholam Reza, Raeisi, Ghaffar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Omidi, Gholam Reza, Raeisi, Ghaffar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grytczuk, Jarosław (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Liu, Xikui, Li, Yan (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Alishahi, Meysam, Taherkhani, Ali, Thomassen, Carsten (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jean-Sébastien Sereni, Zelealem B. Yilma (2013)
Discussiones Mathematicae Graph Theory
Similarity:
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.
Chao, Chong-Yun (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
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
William F. Klostermeyer, Gary MacGillivray (2004)
Discussiones Mathematicae Graph Theory
Similarity:
We examine subgraphs of oriented graphs in the context of oriented coloring that are analogous to cliques in traditional vertex coloring. Bounds on the sizes of these subgraphs are given for planar, outerplanar, and series-parallel graphs. In particular, the main result of the paper is that a planar graph cannot contain an induced subgraph D with more than 36 vertices such that each pair of vertices in D are joined by a directed path of length at most two.
Sebastian Urbański (1996)
Discussiones Mathematicae Graph Theory
Similarity:
The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K₅ and such that every 2-coloring of its edges results in a monochromatic triangle. A new 14-vertex K₄-free graph with the same Ramsey property in the vertex coloring case is found. This yields a new construction of one of the only two known 15-vertex (3,3)-Ramsey graphs not containing K₅.
Kratochvíl, J. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Axenovich, Maria (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nedialkov, Evgeni, Nenov, Nedyalko (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: