{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:22:04Z","timestamp":1758266524763},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0166-218x(90)90010-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"297-301","source":"Crossref","is-referenced-by-count":1,"title":["Communication in m-connected graphs"],"prefix":"10.1016","volume":"28","author":[{"given":"Adam","family":"Idzik","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90010-A_BIB1","article-title":"Problem session","author":"Frank","year":"1975","journal-title":"Proceedings Fifth British Combinatorial Conference, Aberdeen"},{"key":"10.1016\/0166-218X(90)90010-A_BIB2","first-page":"485","article-title":"On division of graphs to connected subgraphs in: Combinatorics","author":"Gy\u00f6ri","year":"1978"},{"key":"10.1016\/0166-218X(90)90010-A_BIB3","first-page":"80","article-title":"Partitions of n-connected graphs","volume":"59","author":"Gy\u00f6ri","year":"1983"},{"key":"10.1016\/0166-218X(90)90010-A_BIB4","first-page":"443","article-title":"Characterization of m-connected graphs","volume":"19","author":"Idzik","year":"1987","journal-title":"Zastos. Mat."},{"key":"10.1016\/0166-218X(90)90010-A_BIB5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","article-title":"A homology theory for spanning trees of a graph","volume":"30","author":"Lov\u00e1sz","year":"1977","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0166-218X(90)90010-A_BIB6","article-title":"Problem session","author":"Maurer","year":"1975","journal-title":"Proceedings Fifth British Combinatorial Conference, Aberdeen"},{"key":"10.1016\/0166-218X(90)90010-A_BIB7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090010A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090010A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:32Z","timestamp":1555135052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090010A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0166218X9090010A"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90010-a","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}