{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:56Z","timestamp":1720640816485},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0653(04)00434-2","type":"journal-article","created":{"date-parts":[[2004,10,23]],"date-time":"2004-10-23T13:17:34Z","timestamp":1098537454000},"page":"41-44","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["m_Path Cover Saturated Graphs"],"prefix":"10.1016","volume":"13","author":[{"given":"Aneta","family":"Dudek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyula Y.","family":"Katona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.Pawel","family":"Wojda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB1","first-page":"111","article-title":"A method in graph theory","volume":"15","author":"Bondy","year":"1976","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u00f6s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4064\/cm-30-2-295-316","article-title":"Hamiltonian circuits and path coverings of vertices in graphs","volume":"30","author":"Skupie","year":"1974","journal-title":"Colloq. Math"},{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.4064\/cm-36-2-305-318","article-title":"Hamiltonian shortage, path partitions of vertices, and matchings in a graph","volume":"36","author":"Skupie","year":"1976","journal-title":"Colloq. Math"},{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190100209","article-title":"Saturated graphs with minimal number of edges","volume":"10","author":"K\u00e1szonyi","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00434-2_NEWBIB6","doi-asserted-by":"crossref","first-page":"205","DOI":"10.7151\/dmgt.1076","article-title":"Graphs maximal with respect to absence of hamiltonian path","volume":"18","author":"Zelinka","year":"1998","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T22:55:49Z","timestamp":1549148149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":6,"alternative-id":["S1571065304004342"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00434-2","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}