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

DOI10.1007/BF01588246zbMATH Open0417.90069MaRDI QIDQ3208440FDOQ3208440

Authors: Clyde l. Monma, Leslie E. jun. Trotter 

Publication date: 1979

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

zbMATH Keywords

polyhedracliqueperfect graphs(0,1)-valued extreme pointsanti-blockinganticlique

Mathematics Subject Classification ID

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

Cites Work

• Normal hypergraphs and the perfect graph conjecture
• On certain polytopes associated with graphs
• A characterization of perfect graphs
• Almost integral polyhedra related to certain combinatorial optimization problems
• Perfect zero–one matrices
• Critical perfect graphs and perfect 3-chromatic graphs
• Anti-blocking polyhedra
• Title not available (Why is that?)
• Graphical properties related to minimal imperfection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208440)