#### Filter Results:

#### Publication Year

2005

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F , a semikernel S modulo F is an independent set such that if some Sz-arc is not in F , then there exists a zS-arc. A sufficient condition on the… (More)

A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ 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. D is called a critical kernel imperfect digraph when D has no kernel but every proper induced subdigraph of D has a kernel. If F is a set… (More)

A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D) − N there exists an arc from w to N. The digraph D is said to be a kernel-perfect digraph when every induced subdigraph of D has a kernel. Minimal non kernel-perfect digraphs are called critical kernel imperfect digraphs. In this paper some new structural results… (More)

A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ 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… (More)

- ‹
- 1
- ›