Graphical properties related to minimal imperfection
type: Item
instance of: scholarly article
title: Graphical properties related to minimal imperfection
zbMATH Open document ID: 0421.05028
DOI: 10.1016/0012-365X(79)90065-7
author: S. H. Smith
published in: Discrete Mathematics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3654147
zbMATH Keywords: minimal imperfect graphs
zbMATH Keywords: partitionable graph
MaRDI profile type: Publication
cites work: Q3941433
cites work: The history of the perfect graphs
cites work: On certain polytopes associated with graphs
cites work: On the strong perfect graph conjecture
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Anti-blocking polyhedra
cites work: Q5685113
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A characterization of perfect graphs
cites work: On the perfect graph conjecture
cites work: Perfect zero–one matrices
cites work: Almost integral polyhedra related to certain combinatorial optimization problems
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
cites work: Q5659563
cites work: Line perfect graphs
cites work: A class of facet producing graphs for vertex packing polyhedra
cites work: The Strong Perfect Graph Conjecture for Planar Graphs
cites work: Coloring a Family of Circular Arcs
cites work: Critical perfect graphs and perfect 3-chromatic graphs
description: scientific article; zbMATH DE number 3654147