Geodesic
Kernels by monochromatic paths and the color-class digraph
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 2, pp. 273-281

Voir la notice de l'article provenant de la source Library of Science

An m-colored digraph is a digraph whose arcs are colored with m colors. A directed path is monochromatic when its arcs are colored alike.
Keywords: kernel, kernel by monochromatic paths, the color-class digraph 
@article{DMGT_2011_31_2_a4,
     author = {Galeana-S\'anchez, Hortensia},
     title = {Kernels by monochromatic paths and the color-class digraph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {273--281},
     publisher = {mathdoc},
     volume = {31},
     number = {2},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a4/}
}
TY  - JOUR
AU  - Galeana-Sánchez, Hortensia
TI  - Kernels by monochromatic paths and the color-class digraph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2011
SP  - 273
EP  - 281
VL  - 31
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a4/
LA  - en
ID  - DMGT_2011_31_2_a4
ER  - 
%0 Journal Article
%A Galeana-Sánchez, Hortensia
%T Kernels by monochromatic paths and the color-class digraph
%J Discussiones Mathematicae. Graph Theory
%D 2011
%P 273-281
%V 31
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a4/
%G en
%F DMGT_2011_31_2_a4
Galeana-Sánchez, Hortensia. Kernels by monochromatic paths and the color-class digraph. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 2, pp. 273-281. http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a4/