http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Abstract: "A pseudo-subgraph of a graph G is a special minor of G with restricted edge contractions allowed. In this first paper of a series, it is shown that every 4-connected graph contains a pseudo-subgraph that is either the complete graph K₅ or the double-axle wheel W²₄ on four vertices. This result establishes the foundation for a structural theorem and efficient algorithms for 4-connected graphs that will appear in the subsequent papers in the series."
Supported in part by Texas A&M TEES Excellence grant
Supported in part by NATO International Scientific Exchange Program. CRG No. 911016
Technical report (Texas A & M University. Computer Science Department) ; 92-019