𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On kernel-perfect orientations of line graphs

✍ Scribed by O.V. Borodin; A.V. Kostochka; D.R. Woodall

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
246 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Kernels in perfect line-graphs
Kernels in perfect line-graphs
✍ FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 491 KB
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

Orientations of graphs in kernel theory
Orientations of graphs in kernel theory
✍ H. Galeana-SΓ‘nchez; V. Neumann-Lara πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 589 KB

In this paper we investigate structural properties of a certain class of graphs (%&free graphs) which are relevant in the study of kernel theory, m-free graphs satisfy the strong perfect graph conjecture of Berge. We investigate orientations of Z&free graphs and other classes of graphs which produce

A theorem about a conjecture of H. Meyni
A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
✍ Hortensia Galeana-SΓ‘nchez πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 391 KB

A digraph D is said to be an R-digraph (kernel-perfect graph) if all of its induced subdigraphs possesses a kernel (independent dominating subset). I show in this work that a digraph D, without directed triangles all of whose odd directed cycles C = (1, 2,..., 2n + 1, 1), possesses two short chords