{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:15:30Z","timestamp":1649128530326},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1007\/s00373-007-0746-8","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T09:06:58Z","timestamp":1192439218000},"page":"521-527","source":"Crossref","is-referenced-by-count":3,"title":["Up-Embeddability of a Graph by Order and Girth"],"prefix":"10.1007","volume":"23","author":[{"given":"Yichao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanpei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"746_CR1","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, Macmillan, London 1979"},{"key":"746_CR2","unstructured":"Huang, Y.Q., Liu, Y.P.: An improvement of a theorem on the maximum genus for graphs, Math. Appl. 11, 109\u2013112 (1998)"},{"key":"746_CR3","unstructured":"Huang, Y.Q., Liu. Y.P.: The degree-sum of nonadjacent vertices and up-embeddability of graphs, Chinese J. Contemp. Math. 19, 651\u2013656 (1998) (in Chinese)"},{"key":"746_CR4","doi-asserted-by":"crossref","unstructured":"Jaeger, F., Payan, C., Xuong, N.H.: A class of upper embeddable graphs, J. Graph Theory 3, 387\u2013391 (1979)","DOI":"10.1002\/jgt.3190030409"},{"key":"746_CR5","unstructured":"Jungerman, M.: A characterization of upper embeddable graphs, Trans. Am. Math. Soc. 241, 401\u2013406 (1987)"},{"key":"746_CR6","unstructured":"Khomendo, N.P., Glukhov, A.D.: On upper embeddable graphs. Graph Theory, (N.P. Khomenko, ed) Izd. Akad. Nauk. Ukrain. SSR. Kiev., pp 85\u201387 (1977) (in Russian)"},{"key":"746_CR7","unstructured":"Kundu, S.: Bounds on number of disjoint spanning trees, J. Combin. Theory B 17, 199\u2013203 (1974)"},{"key":"746_CR8","unstructured":"Liu, Y.P.: The maximum orientable genus of a graph, Scientia Sinica, Special Issue on Math. II, 41\u201355 (1979)"},{"key":"746_CR9","unstructured":"Liu, Y.P.: Embeddability in Graphs, Kluwer, Dordrecht\/Boston\/London, 1995"},{"key":"746_CR10","doi-asserted-by":"crossref","unstructured":"Nebesky, L.: Every connected, locally connected graph is upper embeddable, J. Graph Theory 3, 197\u2013199 (1981)","DOI":"10.1002\/jgt.3190050211"},{"key":"746_CR11","unstructured":"Nebesky, L.: On locally quasiconnected graph and their upper embeddability, Czech. Math. J. 35, 162\u2013166 (1985)"},{"key":"746_CR12","unstructured":"Nebesky, L.: N2-connected graph and their upper embeddability, Czech. Math. J. 41, 731\u2013735 (1991)"},{"key":"746_CR13","unstructured":"Nebesky, L.: A new characterization of the maximum genus of a graph, Czech. Math. J. 31, 604\u2013613 (1981)"},{"key":"746_CR14","doi-asserted-by":"crossref","unstructured":"Nedela, R., Skoviera, M.: Topics in combinatorics and graph theory. R. Bodendiek and R. Henn (eds), Physicaverlay, Heideberg, pp 519\u2013525 (1990)","DOI":"10.1007\/978-3-642-46908-4_59"},{"key":"746_CR15","unstructured":"Nordhaus, E.A., Stewart, B.M., White, A.T.: On the maximum genus of a graph, J. Combin. Theory 11, 285\u2013267 (1971)"},{"key":"746_CR16","unstructured":"Nordhaus, E.A., Ringeisen, R.D., Stewart, B.M., White, A.T.: A Kuratowski type theorem for the maximum genus of a graph, J. Combin. Theory B 12, 260\u2013267 (1972)"},{"key":"746_CR17","unstructured":"Skoviera, M.: On the maximum genus of graphs of diameter two, Discrete Math. 87, 175\u2013180 (1991)"},{"key":"746_CR18","unstructured":"Skoviera, M., Nedela, R.: The maximum genus of a graph and doubly Eulerian trail, Bulletin, U. M. I. 4B, 541\u2013545 (1990)"},{"key":"746_CR19","unstructured":"White, A.T.: Graphs, Groups and Surfaces, 2nd edn, Elsevier, Amsterdam, 1984"},{"key":"746_CR20","unstructured":"Xuong, N.H.: How to determine the maximum genus of a graph, J. Combin. Theory B 26, 217\u2013225 (1979)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0746-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0746-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0746-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0746-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0746-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}