Geodesic
Kernels in edge coloured line digraph
Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 91-98 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the two following conditions (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and (ii) for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-monochromatic directed path.
Keywords: kernel, kernel by monochromatic paths, line digraph, edge coloured digraph 
@article{DMGT_1998_18_1_a7,
     author = {Galeana-S\'anchez, H. and Pastrana Ram{\'\i}rez, L.},
     title = {Kernels in edge coloured line digraph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {91--98},
     year = {1998},
     volume = {18},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a7/}
}
TY  - JOUR
AU  - Galeana-Sánchez, H.
AU  - Pastrana Ramírez, L.
TI  - Kernels in edge coloured line digraph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1998
SP  - 91
EP  - 98
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a7/
LA  - en
ID  - DMGT_1998_18_1_a7
ER  - 
%0 Journal Article
%A Galeana-Sánchez, H.
%A Pastrana Ramírez, L.
%T Kernels in edge coloured line digraph
%J Discussiones Mathematicae. Graph Theory
%D 1998
%P 91-98
%V 18
%N 1
%U http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a7/
%G en
%F DMGT_1998_18_1_a7
Galeana-Sánchez, H.; Pastrana Ramírez, L. Kernels in edge coloured line digraph. Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 91-98. http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a7/

[1] C. Berge, Graphs (North Holland, Amsterdam, New York, 1985).

[2] H. Galeana-Sánchez, On monochromatic paths and monochromatic cycles in edge coloured tournaments, Discrete Math. 156 (1996) 103-112, doi: 10.1016/0012-365X(95)00036-V.

[3] H. Galeana-Sánchez and J.J. García Ruvalcaba, Kernels in {C₃, T₃}-free arc colorations of Kₙ - e, submitted.

[4] B. Sands, N. Sauer and R. Woodrow, On Monochromatic Paths in Edge Coloured Digraphs, J. Combin. Theory (B) 33 (1982) 271-275, doi: 10.1016/0095-8956(82)90047-8.

[5] Shen Minggang, On Monochromatic Paths in m-Coloured Tournaments, J. Combin. Theory (B) 45 (1988) 108-111, doi: 10.1016/0095-8956(88)90059-7.