Results 1 
5 of
5
The obstructions for toroidal graphs with no K3,3’s
, 2005
"... Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no K3,3subdivisions that coincide with the toroidal graphs with no K3,3minors. These graphs admit a unique decomposition into planar components and have short lists of obstructions. We provide ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Forbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal graphs with no K3,3subdivisions that coincide with the toroidal graphs with no K3,3minors. These graphs admit a unique decomposition into planar components and have short lists of obstructions. We provide the complete lists of four forbidden minors and eleven forbidden subdivisions for the toroidal graphs with no K3,3’s and prove that the lists are sufficient.
Simpler Projective Plane Embedding
, 2000
"... A projective plane is equivalent to a disk with antipodal points identified. A graph is projective planar if it can be drawn on the projective plane with no crossing edges. A linear time algorithm for projective planar embedding has been described by Mohar. We provide a new approach that takes O(n ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A projective plane is equivalent to a disk with antipodal points identified. A graph is projective planar if it can be drawn on the projective plane with no crossing edges. A linear time algorithm for projective planar embedding has been described by Mohar. We provide a new approach that takes O(n 2 ) time but is much easier to implement. We programmed a variant of this algorithm and used it to computationally verify the known list of all the projective plane obstructions. Key words: graph algorithms, surface embedding, graph embedding, projective plane, forbidden minor, obstruction 1 Background A graph G consists of a set V of vertices and a set E of edges, each of which is associated with an unordered pair of vertices from V . Throughout this paper, n denotes the number of vertices of a graph, and m is the number of edges. A graph is embeddable on a surface M if it can be drawn on M without crossing edges. Archdeacon's survey [2] provides an excellent introduction to topologica...
A Faster Algorithm for Torus Embedding
, 2004
"... Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We describe a simple exponential algorithm for embedding graphs on the torus (a surface shaped like a doughnut) and di ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We describe a simple exponential algorithm for embedding graphs on the torus (a surface shaped like a doughnut) and discuss how it was inspired by the quadratic time planar embedding algorithm of Demoucron, Malgrange and Pertuiset. We show that it is faster in practice than the only fully implemented alternative (also exponential) and explain how both the algorithm itself and the knowledge gained during its development might be used to solve the wellstudied problem of finding the complete set of torus obstructions.
Cascades and Obstructions of Low Connectivity for Embedding Graphs into the Klein Bottle
"... The structure of graphs with a 2vertexcut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These constituents, called hoppers and cascades, are classified for the case when Euler genus is small. As a consequence, the compl ..."
Abstract
 Add to MetaCart
(Show Context)
The structure of graphs with a 2vertexcut that are critical with respect to the Euler genus is studied. A general theorem describing the building blocks is presented. These constituents, called hoppers and cascades, are classified for the case when Euler genus is small. As a consequence, the complete list of obstructions of connectivity 2 for embedding graphs into the Klein bottle is obtained. 1