Clique Family Inequalities for the Stable Set Polytope of Quasi-Line Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(03)00400-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

The Hirsch Conjecture for the Fractional Stable Set Polytope

Mathematical Programming, Series B
MathematicsSoftware
2013English

New Clique and Independent Set Algorithms for Circle Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1993English

Gap Inequalities for the Cut Polytope

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
1996English

A New Family of Facet Defining Inequalities for the Maximum Edge-Weighted Clique Problem

Optimization Letters
ControlOptimization
2016English

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Competition Numbers, Quasi-Line Graphs, and Holes

SIAM Journal on Discrete Mathematics
Mathematics
2014English

On Clique Convergent Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1995English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Clique-Cutsets Beyond Chordal Graphs

Journal of Graph Theory
GeometryTopology
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy