A. Galluccio and A. Sassano, The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. J. Comb. Theory B 69 (1997) 1--38 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
About Facets of the Stable Set Polytope of a Graph - Pecher (2000) (Correct)
.... be a rather di cult task (see Padberg [8] Chvtal [3] Lovsz [5] Lovsz and Plummer [6] Nethertheless some necessary or su cient conditions appeared in the litterature mostly in the seventees, which are detailed in Balas and Padberg s survey [1] In particular, in 1997, Galluccio and Sassano [4] mentioned a necessary condition due to Balas and Zemel [2] and a su cient condition stated by Chvtal [3] Balas and Zemel s necessary condition does not seem to be wide known nowadays: in 1998, S. Markossian, G. Gasparian, I. Karapetian and A. Markosian proved a more restrictive one in their ....
A. Galluccio and A. Sassano, The rank facets of the stable set polytope for claw-free graphs, J. Comb. Theory Series B 69 (1997), 138.
Chair-free Berge Graphs are Perfect - Sassano (1996) (2 citations) Self-citation (Sassano) (Correct)
.... have been first exploited by Lovasz and Plummer in their polynomial algorithm for computing the stability number of claw free graphs [12] Subsequently, this operation has been crucial for deriving the description of the rank facets of the polytope STAB(G) associated with a claw free graph G [9], for designing a polynomial algorithm that finds the stability number of a chair and bull free graph [8] and for computing good upper bounds for #(G) in general graphs [13] Also in the realm of perfect graphs the reduction operation has interesting consequences. In fact, in [20] it is proved ....
A. Galluccio and A. Sassano, The rank facets of the stable set polytope for claw-free graphs, Technical Report n. 340, IASI-CNR, Rome (1994).
A Construction for Non-Rank Facets of Stable Set Polytopes of.. - Pecher, Wagler (2003) (Correct)
No context found.
A. Galluccio and A. Sassano, The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. J. Comb. Theory B 69 (1997) 1--38
Almost All Webs With Odd Clique Number ≥ 5 Are Not.. - Pecher, Wagler (2003) (Correct)
No context found.
A. Galluccio and A. Sassano, The Rank Facets of the Stable Set Polytope for Claw-Free Graphs. J. Comb. Theory B 69 (1997) 1--38
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC