Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
From MaRDI portal
Publication:3596357
DOI10.1007/11496915_22zbMath1119.90066MaRDI QIDQ3596357
Gianpaolo Oriolo, Friedrich Eisenbrand, Paolo Ventura, Gautier Stauffer
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_22
90C35: Programming involving graphs or networks
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
$t$-Perfection in $P_5$-Free Graphs, On the feedback vertex set polytope of a series-parallel graph, A construction for non-rank facets of stable set polytopes of webs, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, On facets of stable set polytopes of claw-free graphs with stability number 3, Characterizing and bounding the imperfection ratio for some classes of graphs, The representation polyhedron of a semiorder., A note on the Chvátal-rank of clique family inequalities, Generalized clique family inequalities for claw-free graphs, On facets of stable set polytopes of claw-free graphs with stability number three