Geodesic
On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect
Discussiones Mathematicae. Graph Theory, Tome 21 (2001) no. 1, pp. 77-93 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

A digraph D is called a kernel-perfect digraph or KP-digraph when every induced subdigraph of D has a kernel.
Keywords: kernel, kernel-perfect digraph, m-coloured digraph 
@article{DMGT_2001_21_1_a5,
     author = {Galeana-S\'anchez, Hortensia and Garc{\'\i}a-Ruvalcaba, Jos\'e},
     title = {On graphs all of whose {{C₃,T₃}-free} arc colorations are kernel-perfect},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {77--93},
     year = {2001},
     volume = {21},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a5/}
}
TY  - JOUR
AU  - Galeana-Sánchez, Hortensia
AU  - García-Ruvalcaba, José
TI  - On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2001
SP  - 77
EP  - 93
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a5/
LA  - en
ID  - DMGT_2001_21_1_a5
ER  - 
%0 Journal Article
%A Galeana-Sánchez, Hortensia
%A García-Ruvalcaba, José
%T On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect
%J Discussiones Mathematicae. Graph Theory
%D 2001
%P 77-93
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a5/
%G en
%F DMGT_2001_21_1_a5
Galeana-Sánchez, Hortensia; García-Ruvalcaba, José. On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect. Discussiones Mathematicae. Graph Theory, Tome 21 (2001) no. 1, pp. 77-93. http://geodesic.mathdoc.fr/item/DMGT_2001_21_1_a5/

[1] H. Galeana-Sánchez and J.J. García, Kernels in the closure of coloured digraphs, submitted.

[2] 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.