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...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Taylor & Francis Group
2015-11-01
|
| Serija: | AKCE International Journal of Graphs and Combinatorics |
| Teme: | |
| Online pristup: | http://www.sciencedirect.com/science/article/pii/S0972860015000304 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|