{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:35Z","timestamp":1725663395962},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:18:31Z","timestamp":1330211911000},"page":"190-198","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Benkouar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. G.","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Saad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","first-page":"11","volume-title":"Theory of Graphs","author":"M. Bankfalvi","year":"1968","unstructured":"M. BANKFALVI and Z. BANKFALVI, Alternating Hamiltonian Circuit in Two-Coloured Complete Graphs, Theory of Graphs (Proc. Colloq. Tihany 1968), Academic Press, New York, pp. 11\u201318."},{"key":"21_CR2","unstructured":"A. BENKOUAR, Y. G. MANOUSSAKIS, V. Th. PASCHOS and R. SAAD, On the Complexity of some Hamiltonian Problems in Edge-Colored Complete Graphs, Rapport de Recherche, LRI, Universit\u00e9 de Paris-Sud, Centre d'Orsay, 1990."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"B. BOLLOBAS and P. ERDOS, Alternating Hamiltonian Cycles, Israel Journal of Mathematics, Vol. 23, 1976.","DOI":"10.1007\/BF02756791"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"A. BONDY and U.S.R. MURTY, Graph Theory with Applications, McMILLAN PRESS LTD, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0095-8956(76)90053-8","volume":"21","author":"C. C. Chen","year":"1976","unstructured":"C. C. CHEN and D. E. DAYKIN, Graphs with Hamiltonian Cycles having Adjacent Lines Different Colors, J. of Combinatorial Theory, (B) 21, pp. 135\u2013139, 1976.","journal-title":"J. of Combinatorial Theory"},{"issue":"No2","key":"21_CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. EDMONDS and R. M. KARP, Theoritical Improvements in Algorithmic Efficiency for Network Flow Problems, J. ACM Vol. 19, No 2, 1972, pp. 248\u2013264.","journal-title":"J. ACM"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"S. EVEN and O. KARIV, An O(n\n2.5) Algorithm for Maximum Matching in General Graphs, in Proceedings of the 16th Annual Sumposium on Foundations of Computer Science (Berkeley, 1975), pp 100\u2013112.","DOI":"10.1109\/SFCS.1975.5"},{"key":"21_CR8","unstructured":"H. FLEISHNER, Eulerian Graphs and Related Topics, Part 1, Volume 1, Series book of the Annals of Discrete Mathematics, North-Holland, 1990."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"S. FORTUNE, J. HOPCROFT and J. WYLLIE, The Directed Subgraph Homeomorphism Problem, Theor.Comput.Science 10 1980, pp 111\u2013121.","journal-title":"Theor.Comput.Science"},{"key":"21_CR10","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. GAREY and D. JOHNSON, Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"21_CR11","unstructured":"P. HELL, Y. MANOUSSAKIS and Z. TUZA, On the Complexity of of Some Packing Problems in Edge-Colored Complete Graphs, manuscript."},{"issue":"No1","key":"21_CR12","first-page":"76","volume":"18","author":"A. Kotzig","year":"1968","unstructured":"A. KOTZIG, Moves Without Forbidden Transitions in a Graph, Mat. Fyz. \u011easopis 18 1968, No 1, pp 76\u201380.","journal-title":"Mat. Fyz. \u011easopis"},{"key":"21_CR13","unstructured":"Y. MANOUSSAKIS, A Linear Algorithm for Finding Hamiltonian Cycles in Tournaments, to appear in Discrete Mathematics."},{"issue":"No2","key":"21_CR14","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0403046","volume":"3","author":"Y. Manoussakis","year":"1990","unstructured":"Y. MANOUSSAKIS and Z. TUZA, Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments, SIAM Journal on Discrete Mathematics, Vol. 3 No 2, 1990, pp 537\u2013543.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"21_CR15","unstructured":"N. ROBERTSON and P.D. SEYMOUR, Graph Minors, to appear in J. Combinatorial Theory series B."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:16:14Z","timestamp":1578525374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_62"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}