Kernels in perfect line-graphs

https://doi.org/10.1016/0095-8956(92)90028-VGet rights and content
Under an Elsevier user license
open archive

Abstract

A kernel of a directed graph D is a set of vertices which is both independent and absorbant. In 1983, Berge and Duchet conjectured that an undirected graph G is perfect if and only if the following condition is satisfied: “If D is any orientation of G such that every clique of D has a kernel, then D has a kernel.” We prove here that the conjecture holds when G is the line-graph of another graph H, i.e., G represents the incidence between the edges of H.

Cited by (0)