Rank-perfect and weakly rank-perfect graphs

DOI10.1007/s001860200203zbMath1015.05030OpenAlexW2091485261MaRDI QIDQ1396923

Annegret K. Wagler

Publication date: 14 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860200203

zbMATH Keywords

stable set polytopeperfect graphcritical edge

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Perfect graphs (05C17)

Related Items (3)

2-clique-bond of stable set polyhedra ⋮ On non-rank facets of stable set polytopes of webs with clique number four ⋮ The stable set polytope for some extensions of \(P_4\)-free graphs

This page was built for publication: Rank-perfect and weakly rank-perfect graphs