{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:08:43Z","timestamp":1778292523520,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540578994","type":"print"},{"value":"9783540483854","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:41:02Z","timestamp":1330245662000},"page":"376-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph ear decompositions and graph embeddings"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saroja P.","family":"Kanchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-56402-0_40","volume":"657","author":"J. Chen","year":"1993","unstructured":"Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Lecture Notes in Computer Science 657 (1993) 103\u2013113","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0095-8956(92)90033-T","volume":"B 55","author":"J. Chen","year":"1992","unstructured":"Chen, J., Gross, J. L.: Limit points for average genus (I): 3-connected and 2-connected simplicial graphs. J. Comb. Theory Ser. B 55 (1992) 83\u2013103","journal-title":"J. Comb. Theory Ser."},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jctb.1993.1009","volume":"B 57","author":"J. Chen","year":"1993","unstructured":"Chen, J., Gross, J. L.: Kuratowski-type theorems for average genus. J. Comb. Theory Ser. B 57 (1993) 100\u2013211","journal-title":"J. Comb. Theory Ser."},{"key":"32_CR4","unstructured":"Chen, J., Gross, J. L., and Rieper, R. G.: Overlap matrices and imbedding distributions. Discrete Mathematics (1993) to appear"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/3-540-56402-0_45","volume":"657","author":"J. Chen","year":"1993","unstructured":"Chen, J. and Kanevsky, A.: On assembly of 4-connected graphs. Lecture Notes in Computer Science 657 (1993) 158\u2013169","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR6","unstructured":"Chen, J., Kanevsky, A., Tamassia, R.: Linear time construction of 3-connected ear decomposition of a graph, The 22nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing. Baton Rouge, Feb. 11\u201315 (1991)"},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cheriyan","year":"1988","unstructured":"Cheriyan, J. and Maheshwari, S. N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9 (1988) 507\u2013537","journal-title":"J. Algorithms"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","volume":"35-3","author":"M. Furst","year":"1988","unstructured":"Furst, M., Gross, J. L., and McGeoch, L. A.: Finding a maximum-genus graph imbedding. J. ACM 35-3 (1988) 523\u2013534","journal-title":"J. ACM"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/BFb0015746","volume":"194","author":"H. N. Gabow","year":"1985","unstructured":"Gabow, H. N. and Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. Lecture Notes in Computer Science 194 (1985) 210\u2013220","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR10","volume-title":"Topological Graph Theory","author":"J. L. Gross","year":"1987","unstructured":"Gross, J. L., Tucker, T. W.: Topological Graph Theory. Wiley-Interscience, New York (1987)"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(91)90004-O","volume":"42","author":"A. Kanevsky","year":"1991","unstructured":"Kanevsky, A. and Ramachandran, V.: Improved algorithms for graph four-connectivity. J. Computer and System Sciences 42 (1991) 288\u2013306","journal-title":"J. Computer and System Sciences"},{"key":"32_CR12","unstructured":"Lovasz, L.: Computing ears and branchings in parallel. Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (1985) 464\u2013467"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(71)90036-0","volume":"B 11","author":"E. Nordhaus","year":"1971","unstructured":"Nordhaus, E., Stewart, B., and White, A.: On the maximum genus of a graph. J. Comb. Theory Ser. B 11 (1971) 258\u2013267","journal-title":"J. Comb. Theory Ser."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Preparata, F. P. and Shamos, M. I.: Computational Geometry: An Introduction. Springer-Verlag (1985)","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"32_CR15","unstructured":"Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. in Synthesis of Parallel Algorithms, Ed. Reif, Morgan-Kaufmann (1993)"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190030102","volume":"3","author":"R. Ringeisen","year":"1979","unstructured":"Ringeisen, R.: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979) 1\u201313","journal-title":"J. Graph Theory"},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B. and Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Computing 17 (1988) 1253\u20131262","journal-title":"SIAM J. Computing"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0095-8956(74)90034-3","volume":"B 17","author":"P. J. Slater","year":"1974","unstructured":"Slater, P. J.: A classification of 4-connected graphs. J. Comb. Theory Ser. B 17 (1974) 281\u2013298","journal-title":"J. Comb. Theory Ser."},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339\u2013362","journal-title":"Trans. Amer. Math. Soc."},{"key":"32_CR20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"B 26","author":"N. H. Xuong","year":"1979","unstructured":"Xuong, N. H.: How to determine the maximum genus of a graph. J. Comb. Theory Ser. B 26 (1979) 217\u2013225","journal-title":"J. Comb. Theory Ser."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:49:38Z","timestamp":1578509378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_67"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}