{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:03Z","timestamp":1725664803960},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:42Z","timestamp":1330295922000},"page":"334-344","source":"Crossref","is-referenced-by-count":2,"title":["A linear-time algorithm for four-partitioning four-connected planar graphs"],"prefix":"10.1007","author":[{"given":"Shin-ichi","family":"Nakano","sequence":"first","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M.E. Dyer","year":"1985","unstructured":"M.E. Dyer and A.M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Applied Mathematics, 10 (1985) 139\u2013153.","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR2","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms, Computer Science Press, Potomac (1979)."},{"unstructured":"E. Gy\u00f6ri, On division of connected subgraphs, Proc. 5th Hungarian Combinational Coll., (1978) 485\u2013494.","key":"26_CR3"},{"doi-asserted-by":"crossref","unstructured":"E. Gy\u00f6ri, Private communication, March 21, 1996.","key":"26_CR4","DOI":"10.1016\/0925-7721(96)00014-4"},{"unstructured":"L. Jou, H. Suzuki and T. Nishizeki, A linear algorithm for finding a nonseparating ear decomposition of triconnected planar graphs, Tech. Rep. of Information Processing Society of Japan, AL40-3 (1994).","key":"26_CR5"},{"key":"26_CR6","first-page":"411","volume":"790","author":"G. Kant","year":"1994","unstructured":"G. Kant, A more compact visibility representation, Proc. of the 19th International Workshop on Graph Theoretic Concepts in Computer Science (WG'93), LNCS 790 (1994) 411\u2013424.","journal-title":"LNCS"},{"key":"26_CR7","first-page":"396","volume":"790","author":"G. Kant","year":"1994","unstructured":"G. Kant and X. He, Two algorithms for finding rectangular duals of planar graphs, Proc. of the 19th International Workshop on Graph Theoretic Concepts in Computer Science (WG'93), LNCS 790 (1994) 396\u2013410.","journal-title":"LNCS"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e1sz","year":"1977","unstructured":"L. Lov\u00e1sz, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hunger, 30 (1977) 241\u2013251.","journal-title":"Acta Math. Acad. Sci. Hunger"},{"issue":"1","key":"26_CR9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF02939489","volume":"9","author":"J. Ma","year":"1994","unstructured":"J. Ma and S. H. Ma, An O(k 2n2) algorithm to find a k-partition in a k-connected graph, J. of Computer Sci. & Technol., 9, 1 (1994) 86\u201391.","journal-title":"J. of Computer Sci. & Technol."},{"issue":"5","key":"26_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H. Suzuki","year":"1990","unstructured":"H. Suzuki, N. Takahashi and T. Nishizeki, A linear algorithm for bipartition of biconnected graphs, Information Processing Letters 33, 5 (1990) 227\u2013232.","journal-title":"Information Processing Letters"},{"issue":"5","key":"26_CR11","first-page":"584","volume":"31","author":"H. Suzuki","year":"1990","unstructured":"H. Suzuki, N. Takahashi, T. Nishizeki, H. Miyano and S. Ueno, An algorithm for tripartitioning 3-connected graphs, Journal of Information Processing Society of Japan 31, 5 (1990) 584\u2013592.","journal-title":"Journal of Information Processing Society of Japan"},{"key":"26_CR12","first-page":"132","volume":"790","author":"K. Wada","year":"1994","unstructured":"K. Wada and K. Kawaguchi, Efficient algorithms for triconnected graphs and 3-edge-connected graphs, Proc. of the 19th International Workshop on Graph Theoretic Concepts in Computer Science (WG'93), LNCS 790 (1994) 132\u2013143.","journal-title":"LNCS"},{"key":"26_CR13","first-page":"319","volume":"903","author":"K. Wada","year":"1995","unstructured":"K. Wada, A. Takaki and K. Kawaguchi, Efficient algorithms for a mixed k-partition problem of graphs without specifying bases, Proc. of the 20th International Workshop on Graph Theoretic Concepts in Computer Science (WG'94), LNCS 903 (1995) 319\u2013330.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:55Z","timestamp":1605647575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}