{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T22:01:54Z","timestamp":1648591314157},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":2876,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1016\/j.disc.2003.03.002","type":"journal-article","created":{"date-parts":[[2005,9,20]],"date-time":"2005-09-20T09:03:42Z","timestamp":1127207022000},"page":"20-27","source":"Crossref","is-referenced-by-count":2,"title":["6-path-connectivity and 6-generation"],"prefix":"10.1016","volume":"301","author":[{"given":"M.","family":"Abreu","sequence":"first","affiliation":[]},{"given":"D.","family":"Labbate","sequence":"additional","affiliation":[]},{"given":"S.C.","family":"Locke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2003.03.002_bib1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(99)00396-9","article-title":"The cycle space of a 3-connected hamiltonian graph","volume":"220","author":"Barovich","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2003.03.002_bib2","unstructured":"J.A. Bondy, personal communication with S.C. Locke, 1979."},{"key":"10.1016\/j.disc.2003.03.002_bib3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.disc.2003.03.002_bib4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0195-6698(83)80018-3","article-title":"Long cycles generate the cycle space of a graph","volume":"4","author":"Hartman","year":"1983","journal-title":"European J. Combin."},{"key":"10.1016\/j.disc.2003.03.002_bib5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0195-6698(85)80035-4","article-title":"A basis for the cycle space of a 2-connected graph","volume":"6","author":"Locke","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/j.disc.2003.03.002_bib6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0304-0208(08)73031-7","article-title":"A basis for the cycle space of a 3-connected graph","volume":"27","author":"Locke","year":"1985","journal-title":"Cycles in Graphs, Ann. Discrete Math."},{"key":"10.1016\/j.disc.2003.03.002_bib7","first-page":"77","article-title":"Long Paths and the Cycle Space of a Graph","volume":"33","author":"Locke","year":"1992","journal-title":"Ars Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X05003262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X05003262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T01:54:14Z","timestamp":1548122054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X05003262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["S0012365X05003262"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2003.03.002","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}