Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
type: Item
instance of: scholarly article
title: Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable
zbMATH Open document ID: 0761.05090
DOI: 10.1007/BF02350628
author: Mostafa Blidia
author: Konrad Engel
published in: Graphs and Combinatorics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 89193
zbMATH Keywords: perfectly orderable graphs
zbMATH Keywords: kernel \(M\)-solvable
zbMATH Keywords: acyclic orientation
zbMATH Keywords: perfect graphs
MaRDI profile type: Publication
cites work: Q3822191
cites work: On kernels in perfect graphs
cites work: Kernels in some orientations of comparability graphs
cites work: Parity graphs are kernel-M-solvable
cites work: Almost all Berge Graphs are Perfect
full work available at URL: https://doi.org/10.1007/bf02350628
OpenAlex ID: W2091248144
description: scientific article; zbMATH DE number 89193