Abstract
LetS be a compact surface with possibly non-empty boundary ϖS and letG be a graph. LetK be a subgraph ofG embedded inS such that ϖS⊑K. Anembedding extension ofK toG is an embedding ofG inS which coincides onK with the given embedding ofK. Minimal obstructions for the existence of embedding extensions are classified in cases whenS is the projective plane or the Möbius band (for several “canonical” choices ofK). Linear time algorithms are presented that either find an embedding extension, or return a “nice” obstruction for the existence of extensions.
Similar content being viewed by others
References
D. Archdeacon: A Kuratowski Theorem for the projective plane,J. Graph Theory,5 (1981), 243–246.
D. Archdeacon, P. Huneke: A Kuratowski theorem for nonorientable surfaces,J. Combin. Theory Ser. B,46 (1989), 173–231.
N. Chiba, T. Nishizeki, S. Abe, T. Ozawa: A linear algorithm for embedding planar graphs usingPQ-trees,J. Comput. System Sci.,30 (1985), 54–76.
S. A., Cook, R. A. Reckhow: Time bounded random access machines,J. Comput. Syst. Sci.,7 (1976), 354–375.
I. S. Filotti, G. L. Miller, J. Reif: On determining the genus of a graph inO(v O(g)) steps, in:Proc. 11th Ann. ACM STOC, Atlanta, Georgia (1979), 27–37.
H. Glover, J. P. Huneke, C. S. Wang: 103 graphs that are irreducible for the projective plane,J. Combin. Theory, Ser. B,27 (1979), 332–370.
J. L. Gross, T. W. Tucker:Topological graph theory, Wiley-Interscience, New York, 1987.
J. E. Hopcroft, R. E. Tarjan: Dividing a graph into triconnected components,SIAM J. Comput.,2 (1973), 135–158.
J. E. Hopcroft, R. E. Tarjan: Efficient planarity testing,J. ACM,21 (1974), 549–568.
M. Juvan, J. Marinček, B., Mohar: Elimination of local bridges,Math. Slovaca, in press.
M. Juvan, J. Marinček, B. Mohar: Obstructions for simple embeddings, submitted.
M. Juvan, J. Marinček, B. Mohar: Embedding graphs in the torus, submitted.
M. Juvan, B. Mohar: Obstructions for 2-Möbius band embedding extension problem,SIAM J. Discrete Math.,10 (1997), 57–72.
B. Mohar: Projective planarity in linear time,J. Algorithms,15 (1993), 482–502.
B. Mohar: Obstructions for the disk and the cylinder embedding extension problems,Combin. Probab. Comput.,3 (1994), 375–406.
B. Mohar: Universal obstructions for embedding extension problems, submitted.
B. Mohar: Embedding graphs in an arbitrary surface in linear time,Proc. 28th Ann. ACM STOC, Philadelphia, ACM Press, 1996, 392–397.
B. Mohar: A linear time algorithm for embedding graphs in an arbitrary surface, submitted.
N. Robertson, P. D. Seymour: Graph minors. VIII. A Kuratowski theorem for general surfaces,J. Combin Theory, Ser. B,48 (1990), 255–288.
N. Robertson, P. D. Seymour: Graph minors. IX. Disjoint crossed paths,J. Combin Theory, Ser. B,49 (1990), 40–77.
P. D. Seymour: Disjoint paths in graphs,Discrete Math.,29 (1980), 293–309.
Y. Shiloach: A polynomial solution to the undirected two paths problem,J. Assoc. Comput. Math.,27 (1980), 445–456.
C. Thomassen: 2-linked graphs,Europ. J. Combin.,1 (1980), 371–378.
W. T. Tutte:Connectivity of graphs, Univ. Toronto Press, Toronto, Ontario; Oxford Univ. Press, London, 1966.
S. G. Williamson: Embedding graphs in the plane—algorithmic aspects,Ann. Discrete Math.,6 (1980), 349–384.
S. G. Williamson: Depth-first search and Kuratowski subgraphs,J. ACM,31 (1984), 681–693.
Author information
Authors and Affiliations
Additional information
Supported in part by the Ministry of Science and Technology of Slovenia, Research Project P1-0210-101-94.