On the complexity of graph embeddings /

Abstract: "It is known that tembedding a graph G into a surface of minimum genus γmin(G) is NP-hard, whereas embedding a graph G into a surface of maximum genus γM(G) can be done in polynomial time. However, the complexity of embedding a graph G into a surface of genus between γmin(G) and γM(...

Full description

Bibliographic Details

Main Author:	Chen, Jianer
Other Authors:	Kanchi, Saroja P., Kanevsky, Arkady, 1961-
Format:	Book
Language:	English
Published:	College Station, Tex. : Texas A & M University, Computer Science Dept., [1993]
Series:	Technical report (Texas A & M University. Computer Science Department) ; 93-008.
Subjects:	Graph theory.