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-4zbMATH Open0691.05021OpenAlexW1967088697MaRDI QIDQ582302FDOQ582302
Authors: A. M. H. Gerards 
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
Recommendations
- Stability critical graphs and ranks facets of the stable set polytope
- Odd-\(K_{4}\)'s in stability critical graphs
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
- On the b-Stable Set Polytope of Graphs without Bad K4
- Odd cycles and matrices with integrality properties
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Paths, Trees, and Flowers
- Lectures on matroids
- On certain polytopes associated with graphs
- Planar 3DM is NP-complete
- Title not available (Why is that?)
- Maximum-Minimum Sätze über Graphen
- A strongly polynomial minimum cost circulation algorithm
- Title not available (Why is that?)
- On total dual integrality
- On the stable set polytope of a series-parallel graph
- Title not available (Why is that?)
- Polytope des independants d'un graphe série-parallèle
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- A class of h-perfect graphs
- Title not available (Why is that?)
- Matrices with the Edmonds-Johnson property
- An orientation theorem for graphs
- A generalization of max flow—min cut
Cited In (14)
- $t$-Perfection in $P_5$-Free Graphs
- Gear composition and the stable set polytope
- On the feedback vertex set polytope of a series-parallel graph
- A combinatorial column generation algorithm for the maximum stable set problem
- Polyhedral techniques in combinatorial optimization I: Theory
- On a theorem of Sewell and Trotter
- On the b-Stable Set Polytope of Graphs without Bad K4
- Stable sets of maximal size in Kneser-type graphs
- A simpler proof for the two disjoint odd cycles theorem
- Separation problems for the stable set polytope
- Complementation in T-perfect graphs
- Odd-\(K_{4}\)'s in stability critical graphs
- Fractional and integral colourings
- Coloring graphs with no \(\text{odd-}K_4\)
This page was built for publication: A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582302)
