Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jin, Zemin, Li, Xueliang (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi (2011)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.
Halina Bielak, Sebastian Kieliszek (2014)
Annales UMCS, Mathematica
Similarity:
Let ex (n,G) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let Pi denote a path consisting of i vertices and let mPi denote m disjoint copies of Pi. In this paper we count ex(n, 3P4)
Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András, Ruszinkó, Miklós, Sarközy, Gábor N., Szemerédi, Endre (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity: