{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:50:07Z","timestamp":1742957407723,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461472537"},{"type":"electronic","value":"9781461472544"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-7254-4_9","type":"book-chapter","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T18:35:43Z","timestamp":1375382143000},"page":"119-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Remarks on the Cycle Plus Triangles Problem"],"prefix":"10.1007","author":[{"given":"Herbert","family":"Fleischner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stiebitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,18]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.3240030102","volume":"3","author":"N. Alon","year":"1992","unstructured":"N. Alon, The strong chromatic number of a graph, Random Structures and Algorithms 3(1) (1992), 1\u20137.","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"N. Alon and M. Tarsi, Colourings and orientations of graphs, Combinatorica 12(2) (1992), 125\u2013134.","journal-title":"Combinatorica"},{"issue":"11","key":"9_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0895-7177(93)90253-U","volume":"17","author":"D. Z. Du","year":"1993","unstructured":"D. Z. Du, D. F. Hsu and F. K. Hwang, The Hamiltonian property of consecutive-d digraphs, Math. Comput. Modelling 17 (1993), no. 11, 61\u201363.","journal-title":"Math. Comput. Modelling"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s and N. G. de Bruijn, A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A 54 (=Indag. Math. 13) (1951),371\u2013373.","DOI":"10.1016\/S1385-7258(51)50053-7"},{"key":"9_CR5","unstructured":"P. Erd\u0151s, On some of my favourite problems in graph theory and block designs, Le Matematiche, Vol. XLV (1990) Fasc.I, 61\u201374."},{"key":"9_CR6","first-page":"373","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai, Kritische Graphen I, Publ. Math. Inst. Hung. Acad. Sci. 8 (1963), 373\u2013395.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0403018","volume":"3","author":"M. R. Fellows","year":"1990","unstructured":"M. R. Fellows, Transversals of vertex partitions of graphs, SIAM J. Discrete Math 3 (1990), 206\u2013215.","journal-title":"SIAM J. Discrete Math"},{"key":"9_CR8","unstructured":"H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol.1, Ann. Discrete Math. 45; Vol. 2, Ann. Discrete Math. 50 (North-Holland, Amsterdam 1990\/91)."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"H. Fleischner and M. Stiebitz, A solution to a colouring problem of P. Erd\u0151s, Discrete Math. 101 (1992), 39\u201348.","DOI":"10.1016\/0012-365X(92)90588-7"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0012-365X(01)00076-0","volume":"244","author":"H. Fleischner","year":"2002","unstructured":"H. Fleischner, Bipartizing matchings and Sabidussi\u2019s compatibility conjecture, Discrete Math. 244 (2002), 77\u201382","journal-title":"Discrete Math."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1016\/j.disc.2007.01.019","volume":"307","author":"A. Hoffmann-Ostenhof","year":"2007","unstructured":"A. Hoffmann-Ostenhof, A counterexample to the bipartizing matching conjecture, Discrete Math. 307 (2007) 2723\u20132733","journal-title":"Discrete Math."},{"key":"9_CR12","unstructured":"H. Sachs, An elementary proof of the cycle-plus-triangles theorem, manuscript."}],"container-title":["The Mathematics of Paul Erd\u0151s II"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-7254-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T14:38:22Z","timestamp":1676817502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-7254-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461472537","9781461472544"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-7254-4_9","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"18 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}