Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
From MaRDI portal
Recommendations
- The stable set polytope of quasi-line graphs
- On the facets of stable set polytopes of circular interval graphs
- On the facets of the stable set polytope of quasi-line graphs
- Generalized clique family inequalities for claw-free graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
Cited in
(16)- Characterizing and bounding the imperfection ratio for some classes of graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- The representation polyhedron of a semiorder.
- Almost all webs are not rank-perfect
- On the facets of stable set polytopes of circular interval graphs
- 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
- Stable Set Polytopes for a Class of Circulant Graphs
- \(t\)-perfection in \(P_5\)-free graphs
- On the facets of the stable set polytope of quasi-line 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
- The stable set polytope of quasi-line graphs
- On facets of stable set polytopes of claw-free graphs with stability number 3
This page was built for publication: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596357)