𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs

✍ Scribed by H. Galeana-Sánchez; V. Neumann-Lara

Book ID
105677121
Publisher
Springer Japan
Year
1994
Tongue
English
Weight
370 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On kernel-perfect critical digraphs
On kernel-perfect critical digraphs
✍ H. Galeana-Sánchez; V. Neumann-Lara 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 528 KB

In this paper we investigate new sufficient conditions for a digraph to be kernel-perfect (KP) and some structural properties of kernel-perfect critical (KPC) digraphs. In particular, it is proved that the asymmetrical part of any KPC digraph is strongly connected. A new method to construct KPC digr

On claw-freeM-oriented critical kernel-i
On claw-freeM-oriented critical kernel-imperfect digraphs
✍ Galeana-S�nchez, H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB

A kernel of a digraph D is an independent and dominating set of vertices of D. A chord of a directed cycle C = (0, 1 , . . . , n, 0) is an arc of D not in C with both terminal vertices in C . A diagonal of C is a chord with j # i -1. Meyniel made the conjecture (now know to be false) that if D is a

A new method to extend kernel-perfect gr
A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
✍ Hortensia Galeana-Sánchez 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 200 KB

## Comnnmicated by G. Berge In [3] Galeana-Stinchez and Neumann-Lara have deveioped a genera! method to extend kernel-perfect graphs to kernel-perfect critical graphs. In this note we construct a class of kernel-perfect critical graphs which can be used to extend any kernel-perfect graph. For gen