Pages that link to "Item:Q1393418"
From MaRDI portal
The following pages link to On certain polytopes associated with graphs (Q1393418):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- The projected faces property and polyhedral relations (Q263204) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← 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 claw-free \(t\)-perfect graphs (Q431021) (← links)
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Pancyclic properties of the graph of some 0-1 polyhedra (Q595680) (← links)
- Total dual integrality and integer polyhedra (Q598999) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- A characterization of cycle-forced bipartite graphs (Q724892) (← 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)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- A note on node packing polytopes on hypergraphs (Q790042) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (Q867926) (← links)
- Simple extensions of polytopes (Q896292) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs (Q925305) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- Composition of stable set polyhedra (Q957369) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- On the enumeration of certain weighted graphs (Q997075) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- On a theorem of Sewell and Trotter (Q1003593) (← links)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- The graph of perfect matching polytope and an extreme problem (Q1044975) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)