Anti-Ramsey numbers for graphs with independent cycles.
Jin, Zemin, Li, Xueliang (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jin, Zemin, Li, Xueliang (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András (1997)
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:
Alexander Halperin, Colton Magnant, Kyle Pula (2014)
Discussiones Mathematicae Graph Theory
Similarity:
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed...
Loh, Po-Shen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saenpholphat, Varaporn, Zhang, Ping (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jiří Matoušek (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Mohar, Bojan, Škrekovski, Riste (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: