New lower bound for multicolor Ramsey numbers for even cycles.
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Norine, Serguei, Zhu, Xuding (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jin, Zemin, Li, Xueliang (2009)
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:
Albertson, Michael O., Chappell, Glenn G., Kierstead, H.A., Kündgen, André, Ramamurthi, Radhika (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hoffman, Dean G., Johnson, Peter D.jun. (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Schauz, Uwe (2006)
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.
Mohar, Bojan, Pisanski, Tomaz (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Robert Šámal (2004)
Archivum Mathematicum
Similarity:
We present an overview of the theory of nowhere zero flows, in particular the duality of flows and colorings, and the extension to antiflows and strong oriented colorings. As the main result, we find the asymptotic relation between oriented and strong oriented chromatic number.