2-restricted extensions of partial embeddings of graphs

European Journal of Combinatorics

Volumn 26, Issue 3-4 SPEC. ISS., 2005, Pages 339-375

  Juvan, Martin ^a   Mohar, Bojan ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12944300923     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2004.02.012     Document Type: Article

References (10)

1. Cook S.A. Reckhow R.A. Time bounded random access machines J. Comput. System Sci. 7 1976 354-375
2. Hopcroft J.E. Tarjan R.E. Efficient planarity testing J. ACM 21 1974 549-568
3. Juvan M. Marinček J. Mohar B. Elimination of local bridges Math. Slovaca 47 1997 85-92
4. Juvan M. Marinček J. Mohar B. Embedding a graph into the torus in linear time in: Balas E. Clausen J. (Eds.) Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science vol. 920 1995 360-363 Springer Berlin
5. Juvan M. Mohar B. Obstructions for 2-Möbius band embedding extension problem SIAM J. Discrete Math. 10 1997 57-72
6. Mohar B. Projective plane and Möbius band obstructions Combinatorica 17 1997 235-266
7. Mohar B. Obstructions for the disk and the cylinder embedding extension problems Combin. Probab. Comput. 3 1994 375-406
8. Mohar B. Universal obstructions for embedding extension problems University of Ljubljana and IMFM Preprint Series vol. 32 (448) 1994 28
9. Mohar B. A linear time algorithm for embedding graphs in an arbitrary surface SIAM J. Discrete Math. 12 1999 6-26
10. Mohar B. Thomassen C. Graphs on Surfaces 2001 The Johns Hopkins University Press Baltimore, London