Abstract
We study the Lovász-Schrijver SDP-operator applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of graphs for which the SDP-operator generates the stable set polytope in one step has been open since 1990. In an earlier publication, we named these graphs N+-perfect. In the current contribution, we propose a conjecture on combinatorial characterization of N+-perfect graphs and make progress towards such a full combinatorial characterization by establishing a new, close relationship among N+-perfect graphs, near-bipartite graphs and a newly introduced concept of full-support-perfect graphs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
