Universal obstructions for embedding extension problems

by Bojan Mohar
Citations:7 - 6 self

Documents Related by Co-Citation

230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
78 Time bounded random access machines – S A Cook, R A Reckhow - 1973
8 Obstructions for the disk and the cylinder embedding extension problems – B Mohar - 1994
311 Handbook of graph theory – J L Gross, J Yellen - 2003
19 Embedding graphs in the plane — algorithmic aspects – S G Williamson - 1980
116 A linear algorithm for embedding planar graphs using PQ-trees,"JCSS 30 – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
41 Graph minors. VIII. A Kuratowski theorem for general surfaces – N Robertson, P D Seymour - 1990
178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
56 A linear time algorithm for embedding graphs in an arbitrary surface – Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed, Ken-ichi Kawarabayashi, Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed - 1999
4 Efficient algorithm for embedding graphs in arbitrary surfaces – M Juvan, J Marincek, B Mohar
31 Graph minors. IX. Disjoint crossed paths – N Robertson, P D Seymour - 1990
4 Extending 2-restricted partial embeddings of graphs – M Juvan, B Mohar
21 Embedding graphs in an arbitrary surface in linear time – B Mohar - 1996
11 On determining the genus of a graph – I S Filotti, G L Miller, J Reif - 1979
21 A depth-first search characterization of planarity – H de Fraysseix, P Rosenstiehl - 1982
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
13 Projective planarity in linear time – B Mohar - 1993
22 A Kuratowski theorem for nonorientable surfaces – D Archdeacon, P Huneke - 1989