On assembly of four-connected graphs. I, Minimal four- connected graphs /
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1992]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
92-019. |
| Subjects: |
| Summary: | 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." |
|---|---|
| Item Description: | "August 1992." |
| Physical Description: | 26 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |