{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:06:37Z","timestamp":1649091997898},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,9,1]],"date-time":"1981-09-01T00:00:00Z","timestamp":368150400000},"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":[[1981,9]]},"DOI":"10.1007\/bf02579332","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:16:48Z","timestamp":1174601808000},"page":"263-273","source":"Crossref","is-referenced-by-count":4,"title":["Partition conditions and vertex-connectivity of graphs"],"prefix":"10.1007","volume":"1","author":[{"given":"Ervin","family":"Gy\u0151ri","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579332_CR1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1112\/jlms\/s1-38.1.148","volume":"38","author":"G. A. Dirac","year":"1963","unstructured":"G. A. Dirac, Extensions of Menger\u2019s theorem,J. London Math. Soc. 38 (1963), 148\u2013161.","journal-title":"J. London Math. Soc."},{"key":"BF02579332_CR2","unstructured":"A. Frank, Problem session,Proceedings of the Fifth British Combinatorial Conference, 1975., Aberdeen."},{"key":"BF02579332_CR3","unstructured":"A. Frank, Combinatorial algorithms, algorithmic proofs,doctoral dissertation, 1975 (in Hungarian)."},{"key":"BF02579332_CR4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0095-8956(78)90044-8","volume":"24","author":"A. C. Green","year":"1978","unstructured":"A. C. Green, Connectedness and classification of certain graphs,J. Combinatorial Th. B 24 (1978), 267\u2013285.","journal-title":"J. Combinatorial Th. B"},{"key":"BF02579332_CR5","unstructured":"E. Gy\u0151ri, On division of graphs to connected subgraphs,Combinatorics (Proc. Fifth Hungarian Combinatorial Coll., 1976., Keszthely) 485\u2013494, Bolyai \u2014 North-Holland, 1978."},{"key":"BF02579332_CR6","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. Hungar. 30 (1977), 241\u2013251.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02579332_CR7","unstructured":"S. B. Maurer, Problem Session,Proc. Fifth British Combinatorial Conf., 1975., Aberdeen."},{"key":"BF02579332_CR8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1926","unstructured":"K. Menger, Zur allgemeinen Kurventheorie,Fund. Math.,10 (1926), 96.","journal-title":"Fund. Math."},{"key":"BF02579332_CR9","first-page":"321","volume":"16","author":"D. M. Mesner","year":"1966","unstructured":"D. M. Mesner andM. E. Watkins, Some theorems aboutn-vertex-connected graphs,J. Math. Mech. 16 (1966), 321\u2013326.","journal-title":"J. Math. Mech."},{"key":"BF02579332_CR10","unstructured":"K. R. Milliken, Partitioning 3-connected graphs into 3 connected subgraphs, 1976.,unpublished manuscript."},{"key":"BF02579332_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of graphs","author":"O. Ore","year":"1962","unstructured":"O. Ore,Theory of graphs, Amer. Math. Soc., Providence, Rhode Island, 1962."},{"key":"BF02579332_CR12","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, Congruent graphs and the connectivity of graphs,Amer. J. Math. 54 (1932), 150\u2013168.","journal-title":"Amer. J. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579332.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579332\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:02Z","timestamp":1558197902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,9]]}},"alternative-id":["BF02579332"],"URL":"https:\/\/doi.org\/10.1007\/bf02579332","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,9]]}}}