Results 1 
4 of
4
A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded treewidth
, 2008
"... ..."
Universal obstructions for embedding extension problems
"... Let K be an induced nonseparating subgraph of a graph G, andletB be the bridge of K in G. Obstructions for extending a given 2cell embedding of K to an embedding of G in the same surface are considered. It is shown that it is possible to find a nice obstruction which means that it has bounded bran ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Let K be an induced nonseparating subgraph of a graph G, andletB be the bridge of K in G. Obstructions for extending a given 2cell embedding of K to an embedding of G in the same surface are considered. It is shown that it is possible to find a nice obstruction which means that it has bounded branch size up to a bounded number of “almost disjoint ” millipedes. Moreover, B contains a nice subgraph ˜ B with the following properties. If K is 2cell embedded in some surface and F is a face of K, then ˜ B admits exactly the same types of embeddings in F as B. A linear time algorithm to construct such a universal obstruction ˜ B is presented. At the same time, for every type of embeddings of ˜ B, an embedding of B ofthesametypeis determined.
Embedding a Graph Into the Torus in Linear Time
, 1994
"... A linear time algorithm is presented that, for a given graph G, finds an embedding of G in the torus whenever such an embedding exists, or exhibits a subgraph\Omega of G of small branch size that cannot be embedded in the torus. 1 Introduction Let K be a subgraph of G, and suppose that we are ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A linear time algorithm is presented that, for a given graph G, finds an embedding of G in the torus whenever such an embedding exists, or exhibits a subgraph\Omega of G of small branch size that cannot be embedded in the torus. 1 Introduction Let K be a subgraph of G, and suppose that we are given an embedding of K in some surface. The embedding extension problem asks whether it is embedding extension problem possible to extend the embedding of K to an embedding of G in the same surface, and any such embedding is an embedding extension of K to G. An embedding extension obstruction for embedding extensions is a subgraph\Omega of G \Gamma E(K) such that obstruction the embedding of K cannot be extended to K [ \Omega\Gamma The obstruction is small small if K [\Omega is homeomorphic to a graph with a small number of edges. If\Omega is small, then it is easy to verify (for example, by checking all the possibilities Supported in part by the Ministry of Science and Technolo...
Obstructions for simple embeddings
"... Suppose that K ⊆ G is a graph embedded in some surface and F is a face of K with singular branches e and f such that F ∪ ∂F is homeomorphic to the torus minus an open disk. An embedding extension of K to G is a simple embedding if each Kbridge embedded in F is attached to at most one appearance of ..."
Abstract
 Add to MetaCart
(Show Context)
Suppose that K ⊆ G is a graph embedded in some surface and F is a face of K with singular branches e and f such that F ∪ ∂F is homeomorphic to the torus minus an open disk. An embedding extension of K to G is a simple embedding if each Kbridge embedded in F is attached to at most one appearance of e and at most one appearance of f on ∂F. Combinatorial structure of minimal obstructions for existence of simple embedding extensions is described. Moreover, a linear time algorithm is presented that either finds a simple embedding, or returns an obstruction for existence of such embeddings. 1