A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
type: Item
instance of: scholarly article
title: A new method to extend kernel-perfect graphs to kernel-perfect critical graphs
zbMATH Open document ID: 0675.05033
DOI: 10.1016/0012-365X(88)90022-2
author: Hortensia Galeana-Sánchez
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: A digraph D is said to be kernel-perfect if every induced subdigraph of D has a kernel and it is said to be kernel-perfect critical if every proper induced subdigraph of D has a kernel but D does not. In this communication it is stated that for arbitrary kernel-perfect digraph D there exists a kernel-perfect critical digraph \(D^*\) such that D is an induced subdigraph of \(D^*\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 4104988
zbMATH Keywords: kernel-perfect digraph
zbMATH Keywords: kernel-perfect critical digraph
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Q4099676
cites work: Extending kernel perfect digraphs to kernel perfect critical digraphs
cites work: On kernel-perfect critical digraphs
full work available at URL: 0012-365x(88)90022-2
OpenAlex ID: W2075002862
description: scientific article; zbMATH DE number 4104988