scientific article; zbMATH DE number 3893228

zbMath0561.05025MaRDI QIDQ5184933

S. H. Whitesides

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Efficient algorithms for minimum weighted colouring of some classes of perfect graphs ⋮ Simplicial decompositions of graphs: A survey of applications ⋮ On a conjecture about uniquely colorable perfect graphs ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs ⋮ A vertex critical graph without critical edges ⋮ On distance-3 matchings and induced matchings ⋮ Maximum weight independent sets in hole- and co-chair-free graphs

This page was built for publication: