Obstructions for simple embeddings

Australasian Journal of Combinatorics

Volumn 38, Issue , 2007, Pages 3-25

  Juvan, Martin ^a   Marinček, Jože ^a   Mohar, Bojan ^a,b  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57949113150     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. N. Chiba, T. Nishizeki, S. Abe and T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30 (1985), 54-76.
2. S. A. Cook and R. A. Reckhow, Time bounded random access machines, J. Comput. System Sci. 7 (1976), 354-375.
3. J. L. Gross and T. W. Tucker, Topological graph theory, Wiley-Interscience, New York, 1987.
4. J.E. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. A CM 21 (1974), 549-568.
5. M. Juvan and B. Mohar, Obstructions for 2-Möbius band embedding extension problem, SIAM J. Discrete Math. 10 (1997), 57-72.
6. M. Juvan and B. Mohar, 2-restricted extensions of partial embeddings of graphs, European J. Combin. 26 (2005), 339-375.
7. B. Mohar, Universal obstructions for embedding extension problems, Australas. J. Combin. 36 (2006), 39-68.
8. B. Mohar, Obstructions for the disk and the cylinder embedding extension problems, Combin. Probab. Comput. 3 (1994), 375-406.
9. B. Mohar, Embedding graphs in an arbitrary surface in linear time, Proc. 28th Ann. ACM STOC, Philadelphia, ACM Press (1996), 392-397.
10. B. Mohar, A linear time algorithm for embedding graphs in an arbitrary surface, SI AM J. Discrete Math. 12 (1999), 6-26.
11. B. Mohar and C. Thomassen, Graphs on surfaces, The Johns Hopkins University Press, Baltimore and London, 2001.
12. S. G. Williamson, Embedding graphs in the plane-algorithmic aspects, Ann. Discrete Math. 6 (1980), 349-384.
13. S.G. Williamson, Depth-first search and Kuratowski subgraphs, J. ACM 31 (1984), 681-693.