“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

The stable set polytope and some operations on graphs

The stable set polytope and some operations on graphs We study some operations on graphs in relation to the stable set polytope, for instance, identification of two nodes, linking a pair of nodes by an edge and composition of graphs by subgraph identification. We show that, with appropriate conditions, the descriptions of the stable set polytopes associated with the resulting graphs can be derived from those related to the initial graphs by adding eventual clique inequalities. Thus, perfection and h-perfection of graphs are preserved. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics Elsevier
Loading next page...

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.