Some results in graph emulations /
Abstract: "It is proved that if a non-planar 2-emulable graph is 3-connected, then its 2-emulations are also 3-connected. An important application of this result is a proof of a weaker version of Negami's conjecture that a graph has crosscap number 1 if and only if the graph has a 2-emula...
| 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-018. |
| Subjects: |
| Summary: | Abstract: "It is proved that if a non-planar 2-emulable graph is 3-connected, then its 2-emulations are also 3-connected. An important application of this result is a proof of a weaker version of Negami's conjecture that a graph has crosscap number 1 if and only if the graph has a 2-emulation." |
|---|---|
| Item Description: | "August 1992." |
| Physical Description: | 16 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |