Cycles and transitivity by monochromatic paths in arc-coloured digraphs
A digraph D is an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a∈A(D), then colour(a) will denote the colour has been used on a. A path (or a cycle) is monochromatic if all of its arcs are coloured alike. A set N⊆V(D) is a kernel by monochromatic path...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Taylor & Francis Group
2015-11-01
|
| Colección: | AKCE International Journal of Graphs and Combinatorics |
| Materias: | |
| Acceso en línea: | http://www.sciencedirect.com/science/article/pii/S0972860015000304 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|