Further facet generating procedures for vertex packing polytopes

"Padberg and Nemhauser and Trotter have shown how certain facets of a graph can be obtained from facets of its node induced subgraphs. In a related vein Chvatal has shown cases where knowledge of the integer hull of certain substructures of the graph allows one to obtain the integer hull (complete set of facets) for the given graph. Here we examine three further facet generation procedures. The procedures are valid for general independence systems [...]"