Geodesic
Kernel perfect and critical kernel imperfect digraphs structure
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005) Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

A kernel $N$ of a digraph $D$ is an independent set of vertices of $D$ such that for every $w \in V(D)-N$ there exists an arc from $w$ to $N$. If every induced subdigraph of $D$ has a kernel, $D$ is said to be a kernel perfect digraph. Minimal non-kernel perfect digraph are called critical kernel imperfect digraph. If $F$ is a set of arcs of $D$, a semikernel modulo $F$, $S$ of $D$ is an independent set of vertices of $D$ such that for every $z \in V(D)- S$ for which there exists an $Sz-$arc of $D-F$, there also exists an $zS-$arc in $D$. In this talk some structural results concerning critical kernel imperfect and sufficient conditions for a digraph to be a critical kernel imperfect digraph are presented. 
@article{DMTCS_2005_special_250_a76,
     author = {Galeana-S\'anchez, Hortensia and Guevara, Mucuy-Kak},
     title = {Kernel perfect and critical kernel imperfect digraphs structure},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2005},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     doi = {10.46298/dmtcs.3467},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3467/}
}
TY  - JOUR
AU  - Galeana-Sánchez, Hortensia
AU  - Guevara, Mucuy-Kak
TI  - Kernel perfect and critical kernel imperfect digraphs structure
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3467/
DO  - 10.46298/dmtcs.3467
LA  - en
ID  - DMTCS_2005_special_250_a76
ER  - 
%0 Journal Article
%A Galeana-Sánchez, Hortensia
%A Guevara, Mucuy-Kak
%T Kernel perfect and critical kernel imperfect digraphs structure
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3467/
%R 10.46298/dmtcs.3467
%G en
%F DMTCS_2005_special_250_a76
Galeana-Sánchez, Hortensia; Guevara, Mucuy-Kak. Kernel perfect and critical kernel imperfect digraphs structure. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi: 10.46298/dmtcs.3467

Cité par Sources :