Few colored cuts or cycles in edge colored graphs

Jiří Matoušek

Displaying similar documents to “Few colored cuts or cycles in edge colored graphs”

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:

On Ramsey minimal graphs.

Luczak, Tomasz (1994)

The Electronic Journal of Combinatorics [electronic only]

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.