{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:41:47Z","timestamp":1725892907961},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660194"},{"type":"electronic","value":"9783540487777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48777-8_14","type":"book-chapter","created":{"date-parts":[[2007,3,2]],"date-time":"2007-03-02T13:43:11Z","timestamp":1172842991000},"page":"183-190","source":"Crossref","is-referenced-by-count":2,"title":["An Orientation Theorem with Parity Conditions"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","volume":"10","author":"I. Anderson","year":"1971","unstructured":"I. Anderson, Perfect matchings of a graph, J. Combin. Theory Ser. B, 10 (1971), 183\u2013186.","journal-title":"J. Combin. Theory Ser. B"},{"key":"14_CR2","first-page":"177","volume":"17","author":"O. Chevalier","year":"1983","unstructured":"O. Chevalier, F. Jaeger, C. Payan and N.H. Xuong, Odd rooted orientations and upper-embeddable graphs, Annals of Discrete Mathematics 17, (1983) 177\u2013181.","journal-title":"Annals of Discrete Mathematics"},{"key":"14_CR3","unstructured":"J. Edmonds, Edge-disjoint branchings, in: R. Rustin (Ed.), Combinatorial Algorithms, Academic Press, (1973) 91\u201396."},{"key":"14_CR4","first-page":"111","volume":"113","author":"A. Frank","year":"1996","unstructured":"A. Frank, Orientations of graphs and submodular flows, Congr. Numer. 113 (1996), 111\u2013142.","journal-title":"Congr. Numer."},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48390-X","volume-title":"Parity constrained k-edge-connected orientations","author":"A. Frank","year":"1999","unstructured":"A. Frank, Z. Kir\u00e1ly, Parity constrained k-edge-connected orientations, Proc. Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO), Graz, 1999. LNCS, Springer, this issue."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1145\/44483.44485","volume":"35","author":"M.L. Furst","year":"1988","unstructured":"M.L. Furst, J.L. Gross, and L.A. McGeoch, Finding a maximum genus graph imbedding, J. of the ACM, Vol. 35, No. 3, July 1988, 523\u2013534.","journal-title":"J. of the ACM"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.2307\/1998852","volume":"241","author":"M. Jungerman","year":"1978","unstructured":"M. Jungerman, A characterization of upper embeddable graphs, Trans. Amer. Math. Soc. 241 (1978), 401\u2013406.","journal-title":"Trans. Amer. Math. Soc."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C. St. J. A. Nash-Williams","year":"1961","unstructured":"C. St. J. A. Nash-Williams, Edge-disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445\u2013450.","journal-title":"J. London Math. Soc."},{"issue":"106","key":"14_CR9","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"L. Nebesk\u00fd, A new characterization of the maximum genus of a graph, Czechoslovak Mathematical Journal, 31(106) 1981, 604\u2013613.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"14_CR10","first-page":"121","volume":"42","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz, Selecting independent lines from a family of lines in a space, Acta Sci. Univ. Szeged 42, 1980, 121\u2013131.","journal-title":"Acta Sci. Univ. Szeged"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"26","author":"N.H. Xuong","year":"1979","unstructured":"N.H. Xuong, How to determine the maximum genus of a graph, J. Combin. Theory Ser. B 26 (1979), 217\u2013225.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48777-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T10:44:01Z","timestamp":1628505841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48777-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660194","9783540487777"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48777-8_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}