A linear time algorithm for embedding graphs in an arbitrary surface

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 1, 1999, Pages 6-26

  Mohar, Bojan ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Algorithm; Forbidden minor; Forbidden subgraph; Graph embedding; Obstruction; Surface embedding

Indexed keywords

EID: 0041372793     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548019529248X     Document Type: Article

References (21)

1. D. ARCHDEACON, A Kuratowski theorem for the projective plane, J. Graph Theory, 5 (1981), pp. 243-246.
2. D. ARCHDEACON, The complexity of the graph embedding problem, in Topics in Combinatorics and Graph Theory, R. Bodendiek and R. Henn, eds., Physica-Verlag, Heidelberg, 1990, pp. 59-64.
3. D. ARCHDEACON AND P. HUNEKE, A Kuratowski theorem for nonorientable surfaces, J. Combin. Theory Ser. B, 46 (1989), pp. 173-231.
4. J. BATTLE, F. HARARY, Y. KODAMA, AND J. W. T. YOUNGS, Additivity of the genus of a graph, Bull. Amer. Math. Soc., 68 (1962), pp. 565-568.
5. J. A. BONDY AND U. S. R. MURTY, Graph Theory with Applications, North-Holland, New York, 1981.
6. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trees, J. Comput. System Sci., 13 (1976), pp. 335-379.
7. 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), pp. 54-76.
8. S. A. COOK AND R. A. RECKHOW, Time bounded random access machines, J. Comput. Syst. Sci., 7 (1976), pp. 354-375.
9. H. DJIDJEV AND J. H. REIF, An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs, in 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, May 1991, pp. 337-347.
10. O(g)) steps, in Proc. 11th Annual ACM STOC, Atlanta, GA, 1979, pp. 27-37.
11. H. DE FRAYSSEIX AND P. ROSENSTIEHL, A depth-first search characterization of planarity, Ann. Discrete Math., 13 (1982), pp. 75-80.
12. M. L. FURST, J. L. GROSS, AND L. A. MCGEOCH, Finding a maximum-genus graph imbedding, J. Assoc. Comput. Mach., 35 (1988), pp. 523-534.
13. H. GLOVER, J. P. HUNEKE, AND C. S. WANG, 103 graphs that are irreducible for the projective plane, J. Combin. Theory Ser. B, 27 (1979), pp. 332-370.
14. J. L. GROSS AND T. W. TUCKER, Topological Graph Theory, Wiley-Interscience, New York, 1987.
15. J. E. HOPCROFT AND R. E. TARJAN, Dividing a graph into triconnected components, SIAM J. Comput., 2 (1973), pp. 135-158.
16. J. E. HOPCROFT AND R. E. TARJAN, Efficient planarity testing, J. Assoc. Comput. Mach., 21 (1974), pp. 549-568.
17. M. JUVAN, J. MARINČEK, AND B. MOHAR, Elimination of local bridges, Math. Slovaca, 47 (1997), pp. 85-92.
18. M. JUVAN, J. MARINČEK, AND B. MOHAR, Obstructions for simple embeddings, submitted.
19. M. JUVAN, J. MARINČEK, AND B. MOHAR, Embedding a graph into the torus in linear time, submitted.
20. M. JUVAN AND B. MOHAR, Extending 2-restricted partial embeddings of graphs, submitted.
21. A. KARABEG, Classification and detection of obstructions to planarity, Linear and Multilinear Algebra, 26 (1990), pp. 15-38.