{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:24:21Z","timestamp":1759335861199},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf01200908","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:38:30Z","timestamp":1108741110000},"page":"235-266","source":"Crossref","is-referenced-by-count":1,"title":["Projective plane and M\ufffdbius band obstructions"],"prefix":"10.1007","volume":"17","author":[{"given":"Bojan","family":"Mohar","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/jgt.3190050305","volume":"5","author":"D. Archdeacon","year":"1981","unstructured":"D. Archdeacon: A Kuratowski Theorem for the projective plane,J. Graph Theory,5 (1981), 243?246.","journal-title":"J. Graph Theory"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0095-8956(89)90043-9","volume":"46","author":"D. Archdeacon","year":"1989","unstructured":"D. Archdeacon, P. Huneke: A Kuratowski theorem for nonorientable surfaces,J. Combin. Theory Ser. B,46 (1989), 173?231.","journal-title":"J. Combin. Theory Ser. B"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"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.","journal-title":"J. Comput. System Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S. A. Cook","year":"1976","unstructured":"S. A., Cook, R. A. Reckhow: Time bounded random access machines,J. Comput. Syst. Sci.,7 (1976), 354?375.","journal-title":"J. Comput. Syst. Sci."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/800135.804395"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0095-8956(79)90022-4","volume":"27","author":"H. Glover","year":"1979","unstructured":"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.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"CR7","volume-title":"Topological graph theory","author":"J. L. Gross","year":"1987","unstructured":"J. L. Gross, T. W. Tucker:Topological graph theory, Wiley-Interscience, New York, 1987."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft, R. E. Tarjan: Dividing a graph into triconnected components,SIAM J. Comput.,2 (1973), 135?158.","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1974","unstructured":"J. E. Hopcroft, R. E. Tarjan: Efficient planarity testing,J. ACM,21 (1974), 549?568.","journal-title":"J. ACM"},{"key":"CR10","unstructured":"M. Juvan, J. Marin?ek, B., Mohar: Elimination of local bridges,Math. Slovaca, in press."},{"key":"CR11","unstructured":"M. Juvan, J. Marin?ek, B. Mohar: Obstructions for simple embeddings, submitted."},{"key":"CR12","unstructured":"M. Juvan, J. Marin?ek, B. Mohar: Embedding graphs in the torus, submitted."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0895480194264150","volume":"10","author":"M. Juvan","year":"1997","unstructured":"M. Juvan, B. Mohar: Obstructions for 2-M\ufffdbius band embedding extension problem,SIAM J. Discrete Math.,10 (1997), 57?72.","journal-title":"SIAM J. Discrete Math."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1006\/jagm.1993.1050","volume":"15","author":"B. Mohar","year":"1993","unstructured":"B. Mohar: Projective planarity in linear time,J. Algorithms,15 (1993), 482?502.","journal-title":"J. Algorithms"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0963548300001279","volume":"3","author":"B. Mohar","year":"1994","unstructured":"B. Mohar: Obstructions for the disk and the cylinder embedding extension problems,Combin. Probab. Comput.,3 (1994), 375?406.","journal-title":"Combin. Probab. Comput."},{"key":"CR16","unstructured":"B. Mohar: Universal obstructions for embedding extension problems, submitted."},{"key":"CR17","first-page":"392","volume-title":"Proc. 28th Ann. ACM STOC","author":"B. Mohar","year":"1996","unstructured":"B. Mohar: Embedding graphs in an arbitrary surface in linear time,Proc. 28th Ann. ACM STOC, Philadelphia, ACM Press, 1996, 392?397."},{"key":"CR18","unstructured":"B. Mohar: A linear time algorithm for embedding graphs in an arbitrary surface, submitted."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(90)90121-F","volume":"48","author":"N. Robertson","year":"1990","unstructured":"N. Robertson, P. D. Seymour: Graph minors. VIII. A Kuratowski theorem for general surfaces,J. Combin Theory, Ser. B,48 (1990), 255?288.","journal-title":"J. Combin Theory, Ser. B"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(90)90063-6","volume":"49","author":"N. Robertson","year":"1990","unstructured":"N. Robertson, P. D. Seymour: Graph minors. IX. Disjoint crossed paths,J. Combin Theory, Ser. B,49 (1990), 40?77.","journal-title":"J. Combin Theory, Ser. B"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P. D. Seymour","year":"1980","unstructured":"P. D. Seymour: Disjoint paths in graphs,Discrete Math.,29 (1980), 293?309.","journal-title":"Discrete Math."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Y. Shiloach: A polynomial solution to the undirected two paths problem,J. Assoc. Comput. Math.,27 (1980), 445?456.","journal-title":"J. Assoc. Comput. Math."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen: 2-linked graphs,Europ. J. Combin.,1 (1980), 371?378.","journal-title":"Europ. J. Combin."},{"key":"CR24","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity of graphs","author":"W. T. Tutte","year":"1966","unstructured":"W. T. Tutte:Connectivity of graphs, Univ. Toronto Press, Toronto, Ontario; Oxford Univ. Press, London, 1966."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0167-5060(08)70719-2","volume":"6","author":"S. G. Williamson","year":"1980","unstructured":"S. G. Williamson: Embedding graphs in the plane?algorithmic aspects,Ann. Discrete Math.,6 (1980), 349?384.","journal-title":"Ann. Discrete Math."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1145\/1634.322451","volume":"31","author":"S. G. Williamson","year":"1984","unstructured":"S. G. Williamson: Depth-first search and Kuratowski subgraphs,J. ACM,31 (1984), 681?693.","journal-title":"J. ACM"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200908.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200908\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:12:55Z","timestamp":1586121175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF01200908"],"URL":"https:\/\/doi.org\/10.1007\/bf01200908","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}