𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kernels in perfect line-graphs

✍ Scribed by Frédéric Maffray

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
491 KB
Volume
55
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On a class of kernel-perfect and kernel-
On a class of kernel-perfect and kernel-perfect-critical graphs
✍ Kiran B. Chilakamarri; Peter Hamburger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or

Perfect k-line graphs and k-total graphs
Perfect k-line graphs and k-total graphs
✍ Van Bang Lê 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB 👁 1 views

## Abstract The concept of the line graph can be generalized as follows. The __k__‐line graph __L__~__k__~(__G__) of a graph __G__ is defined as a graph whose vertices are the complete subgraphs on __k__ vertices in __G.__ Two distinct such complete subgraphs are adjacent in __L__~__k__~(__G__) if

Kernels in random graphs
Kernels in random graphs
✍ W.Fernandez de la Vega 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 214 KB

For each fixed p, the random directed graph D(n, p) on n vertices with (directed) edge probability p possesses a kernel with probability tending to 1 as n + a. Pour chaque p fixe, le graphe alCatoire D(n, p) a n sommets et probabilitts des arcs Cgales B p posstde un noyau avec une probabilit6 tenda