Partitioning 3-colored complete graphs into three monochromatic cycles.
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:
Displaying similar documents to “From L. Euler to D. König”
Partitioning 3-colored complete graphs into three monochromatic cycles.
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on graph coloring extensions and list-colorings.
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic, star and oriented colourings of graph subdivisions.
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow -factors.
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Euler formula and maps on surfaces
Siniša T. Vrećica (2011)
The Teaching of Mathematics
Similarity:
The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge-domatically full graphs
Bohdan Zelinka (1990)
Mathematica Slovaca
Similarity:
Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
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.
List edge-colorings of series-parallel graphs.
Juvan, Martin, Mohar, Bojan, Thomas, Robin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: