A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
From MaRDI portal
Publication:582302
DOI10.1016/0095-8956(89)90032-4zbMath0691.05021MaRDI QIDQ582302
Publication date: 1989
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(89)90032-4
05C35: Extremal problems in graph theory
Related Items
Polyhedral techniques in combinatorial optimization I: Theory, Gear composition and the stable set polytope, Fractional and integral colourings, A combinatorial column generation algorithm for the maximum stable set problem, Coloring graphs with no \(\text{odd-}K_4\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of h-perfect graphs
- A strongly polynomial minimum cost circulation algorithm
- Matrices with the Edmonds-Johnson property
- On the stable set polytope of a series-parallel graph
- Polytope des independants d'un graphe série-parallèle
- On total dual integrality
- An orientation theorem for graphs
- On certain polytopes associated with graphs
- Maximum-Minimum Sätze über Graphen
- Planar 3DM is NP-complete
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A generalization of max flow—min cut
- Paths, Trees, and Flowers
- Lectures on matroids
