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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Taylor & Francis Group
2015-11-01
|
| シリーズ: | AKCE International Journal of Graphs and Combinatorics |
| 主題: | |
| オンライン･アクセス: | http://www.sciencedirect.com/science/article/pii/S0972860015000304 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|