On perfect graphs and polyhedra with (0, 1)-valued extreme points

DOI10.1007/BF01588246zbMath0417.90069MaRDI QIDQ3208440

Clyde l. Monma, Leslie E. jun. Trotter

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

polyhedraperfect graphsclique(0,1)-valued extreme pointsanti-blockinganticlique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polytopes and polyhedra (52Bxx)

Cites Work

• Unnamed Item
• Graphical properties related to minimal imperfection
• Almost integral polyhedra related to certain combinatorial optimization problems
• Critical perfect graphs and perfect 3-chromatic graphs
• On certain polytopes associated with graphs
• Anti-blocking polyhedra
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices

This page was built for publication: On perfect graphs and polyhedra with (0, 1)-valued extreme points