{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:52Z","timestamp":1720640812304},"reference-count":20,"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)00426-3","type":"journal-article","created":{"date-parts":[[2004,10,23]],"date-time":"2004-10-23T13:17:34Z","timestamp":1098537454000},"page":"9-13","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Pk+1\u2013Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases"],"prefix":"10.1016","volume":"13","author":[{"given":"Armen","family":"Asratian","sequence":"first","affiliation":[]},{"given":"Natalia","family":"Oksimets","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0012-365X(94)00183-J","article-title":"Triangle-free eulerian tours in graphs with maximum degree at most 4","volume":"138","author":"Adelgren","year":"1995","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB2","doi-asserted-by":"crossref","unstructured":"T. Adelgren, Triangle-free eulerian tours, Research Report no. 11, Depart. Math, Ume\u00e5 University, 1995.","DOI":"10.1016\/0012-365X(94)00183-J"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190140213","article-title":"Perfect path double covers of graphs","volume":"14","author":"Bondy","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB5","first-page":"131","article-title":"Trois types de decompositions d'un graphe en chaines","volume":"17","author":"Bouchet","year":"1983","journal-title":"Ann. Discrete Math"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB6","first-page":"119","article-title":"Decomposition of trees into isomorphic subtrees","volume":"9","author":"Caro","year":"1980","journal-title":"Ars Combinatoria"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","article-title":"On the complexity of partitioning graphs into connected subgraphs","volume":"10","author":"Dyer","year":"1985","journal-title":"Discrete Applied Math"},{"issue":"45","key":"10.1016\/S1571-0653(04)00426-3_NEWBIB8","article-title":"Eulerian graphs and related topics, Part 1","volume":"1","author":"Fleischner","year":"1990","journal-title":"Ann. of Discrete Math"},{"issue":"50","key":"10.1016\/S1571-0653(04)00426-3_NEWBIB9","article-title":"Eulerian graphs and related topics, Part 1","volume":"2","author":"Fleischner","year":"1991","journal-title":"Ann. of Discrete Math"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB10","first-page":"115","article-title":"Decomposition of complete bipartite graphs","volume":"141","author":"H\u00e4ggkvist","year":"1989"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB11","unstructured":"R. H\u00e4ggkvist, Factors and path decompositions, Research report, No 13, Depart. Mathem, Ume\u00e5 Univ., 2001"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB12","unstructured":"R. H\u00e4ggkvist and R. Johansson, A note on edge-decompositions of planar graphs, Research Report no. 5, Department of Math., Ume\u00e5, 2001, 7 pp."},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<187::AID-JGT8>3.0.CO;2-N","article-title":"Perfect double covers with paths of length four","volume":"21","author":"Heinrich","year":"1996","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<135::AID-JGT6>3.0.CO;2-I","article-title":"P4-decompositions of regular graphs","volume":"31","author":"Heinrich","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB15","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1002\/jgt.3190090416","article-title":"On partitioning the edges of graphs into connected subgraphs","volume":"9","author":"Junger","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.21136\/CPM.1957.117236","article-title":"From the theory of finite regular graphs of degree three and four","volume":"82","author":"Kotzig","year":"1957","journal-title":"Casopis Pest Mat"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB17","first-page":"261","article-title":"Path decompositions and perfect path double covers","volume":"19","author":"Kouider","year":"1999","journal-title":"Australazian J. Combinatorics"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB18","unstructured":"N. Oksimets, Triangle-free eulerian tours in graphs with minimum degree at least 6, in Licentiat Thesis, Depart. Math., Ume\u00e5 University, 1997"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB19","unstructured":"N. Oksimets, Characterization of eulerian graphs with triangle-free Euler tours, in Doctoral Thesis, Depart. Math., Ume\u00e5 University, 2003"},{"key":"10.1016\/S1571-0653(04)00426-3_NEWBIB20","unstructured":"N. Oksimets, P5-decompositions of 4-regular triangle-free graphs (in preparation)"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T21:08:26Z","timestamp":1624741706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":20,"alternative-id":["S1571065304004263"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00426-3","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}