Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs

Enrique Casas-BautistaHortensia Galeana-SánchezRocío Rojas-Monroy — 2013

Discussiones Mathematicae Graph Theory

We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a. A path (or a cycle) is called monochromatic if all of its arcs are coloured alike. A γ-cycle in D is a sequence of vertices, say γ = (u0, u1, . . . , un), such that ui ≠ uj if i ≠ j and for every i ∈ 0, 1, . . . , n there is a uiui+1-monochromatic path in D and there is no ui+1ui-monochromatic path in D (the indices...

Page 1

Download Results (CSV)