Pages that link to "Item:Q949780"
From MaRDI portal
The following pages link to The stable set polytope of quasi-line graphs (Q949780):
Displaying 41 items.
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
- Minor related row family inequalities for the set covering polyhedron of circulant matrices (Q324828) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- On mixed-integer sets with two integer variables (Q408383) (← links)
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- A strengthening of Ben Rebea's lemma (Q1321993) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- The Turán polytope (Q1671668) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- Circuits and circulant minors (Q2132343) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- Coloring fuzzy circular interval graphs (Q2851514) (← links)
- The stable set polytope of claw-free graphs with large stability number (Q2861525) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Generalized clique family inequalities for claw-free graphs (Q3439487) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
- Stable Set Polytopes for a Class of Circulant Graphs (Q4702296) (← links)
- Total coloring of quasi-line graphs and inflated graphs (Q5025132) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
