Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
From MaRDI portal
Publication:4307046
DOI10.1137/S089548019018268XzbMath0802.05069MaRDI QIDQ4307046
Francisco Barahona, Ali Ridha Mahjoub
Publication date: 1 December 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
inequalitiesminorstable set polytopelinear programfacetspolyhedral combinatoricscomposition of polyhedracompact systems
Related Items
Fractional and integral colourings, The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs, On the complete set packing and set partitioning polytopes: properties and rank 1 facets, $t$-Perfection in $P_5$-Free Graphs, Separation problems for the stable set polytope, On cuts and matchings in planar graphs, New facets for the set packing polytope, A note on kernels and Sperner's Lemma, A new lifting theorem for vertex packing