{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T11:49:49Z","timestamp":1673092189990},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4276,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0166-218x(01)00213-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:01:51Z","timestamp":1027591311000},"page":"37-47","source":"Crossref","is-referenced-by-count":12,"title":["An orientation theorem with parity conditions"],"prefix":"10.1016","volume":"115","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":"78","reference":[{"key":"10.1016\/S0166-218X(01)00213-X_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","article-title":"Perfect matchings of a graph","volume":"10","author":"Anderson","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB2","first-page":"177","article-title":"Odd rooted orientations and upper-embeddable graphs","volume":"17","author":"Chevalier","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00213-X_BIB3","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB4","first-page":"111","article-title":"Orientations of graphs and submodular flows","volume":"113","author":"Frank","year":"1996","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00213-X_BIB5","series-title":"Proceedings of the IPCO\u201999, Graz","first-page":"191","article-title":"Parity constrained k-edge-connected orientations","volume":"Vol. 1610","author":"Frank","year":"1999"},{"issue":"3","key":"10.1016\/S0166-218X(01)00213-X_BIB6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","article-title":"Finding a maximum genus graph imbedding","volume":"35","author":"Furst","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB7","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, M. Stallmann, Efficient algorithms for graphic matroid intersection and parity, in: Proceedings of the 12th ICALP, Lecture Notes in Computer Science, Vol. 194, Springer, New York, 1985, pp. 210\u2013220.","DOI":"10.1007\/BFb0015746"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB8","unstructured":"S. Iwata, personal communication, 1998."},{"key":"10.1016\/S0166-218X(01)00213-X_BIB9","first-page":"401","article-title":"A characterization of upper embeddable graphs","volume":"241","author":"Jungerman","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(01)00213-X_BIB10","first-page":"121","article-title":"Selecting independent lines from a family of lines in a space","volume":"42","author":"Lov\u00e1sz","year":"1980","journal-title":"Acta Sci. Univ. Szeged"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"issue":"106","key":"10.1016\/S0166-218X(01)00213-X_BIB12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","article-title":"A new characterization of the maximum genus of a graph","volume":"31","author":"Nebesk\u00fd","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/S0166-218X(01)00213-X_BIB13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(71)90036-0","article-title":"On the maximum genus of a graph","volume":"11","author":"Nordhaus","year":"1971","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190030102","article-title":"Survey of results on the maximum genus of a graph","volume":"3","author":"Ringeisen","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00213-X_BIB15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","article-title":"How to determine the maximum genus of a graph","volume":"26","author":"Xuong","year":"1979","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100213X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100213X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T04:38:26Z","timestamp":1620103106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0100213X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0166218X0100213X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00213-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}