{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:15:07Z","timestamp":1694636107897},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"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":[[2009,5]]},"DOI":"10.1007\/s00373-008-0837-1","type":"journal-article","created":{"date-parts":[[2009,5,22]],"date-time":"2009-05-22T11:42:35Z","timestamp":1242992555000},"page":"253-264","source":"Crossref","is-referenced-by-count":0,"title":["Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices"],"prefix":"10.1007","volume":"25","author":[{"given":"Ouyang","family":"Zhangdong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huang","family":"Yuanqiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,23]]},"reference":[{"key":"837_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J. A., Murty, U. S. R.: Graph theory with applications, Macmillan, London (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"837_CR2","unstructured":"Nordhaus, E. A., Stewart, B. M., White, A.T.: On the maximum genus of a graph. J. Combin. Theory 11, 258\u2013267 (1971)"},{"key":"837_CR3","doi-asserted-by":"crossref","unstructured":"Kunda, S.: Bounds on number of disjoint spanning trees. J. Combin. Theory 17B, 199\u2013203 (1974)","DOI":"10.1016\/0095-8956(74)90087-2"},{"key":"837_CR4","unstructured":"Payan, C., and Xoung, N. H.: Upper embeddability and conncetivity of graph. Discrete Math., J 27, 71\u201380 (1979)"},{"key":"837_CR5","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":"837_CR6","doi-asserted-by":"crossref","unstructured":"Nebesky, L.: On quasiconnected graph and their upper embeddable. Czech. Math. J., 35, 110 (1985)","DOI":"10.21136\/CMJ.1985.102005"},{"key":"837_CR7","unstructured":"Skobiera, M., Nedela, R.: The maximum genus of a graph and doubly Eulerian trail. Bulletin. U.M.I., 4B, 541\u2013545 (1990)"},{"key":"837_CR8","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":"837_CR9","doi-asserted-by":"crossref","unstructured":"Skoviera, M.: On the maximum of graphs of diameter two. Discrete Math 87, 175\u2013180 (1991)","DOI":"10.1016\/0012-365X(91)90046-5"},{"key":"837_CR10","doi-asserted-by":"crossref","unstructured":"Nedela, R., Skoviera, M.: Topics in combinatorics and graph theory, R. Bodendiek and R. Henn (Eds), Phusicaverlay, Heideberg, 519\u2013525 (1990)","DOI":"10.1007\/978-3-642-46908-4_59"},{"key":"837_CR11","doi-asserted-by":"crossref","unstructured":"Nebesky, L.: N 2-connected graph and their upper embeddability, Czech. Math. J 41, 116 (1991)","DOI":"10.21136\/CMJ.1991.102504"},{"key":"837_CR12","unstructured":"Jungerman, M.: A Characterization of upper embeddable graphs, Trans. Amer. Math. Soc., 241, 401\u2013406 (1978)"},{"key":"837_CR13","unstructured":"Huang, Y. Q., Liu, Y. P.: The degree-sum of nonadjcent vertices and upper embeddability of graphs. Chin Ann of Math. 19A(5), 651\u2013656 (1998) (in Chinese)"},{"key":"837_CR14","doi-asserted-by":"crossref","unstructured":"Chen, Y.C., Liu, Y.P.: The degree-sum of nonadacent vertices, girth and upembeddability, Graphs and Combinatorics 23, 521\u2013527 (2007)","DOI":"10.1007\/s00373-007-0746-8"},{"key":"837_CR15","doi-asserted-by":"crossref","unstructured":"Xuong, N. H.: How to determine the maximum genus of a graph. J. Combinatorial Theory 26B, 217\u2013225 (1979)","DOI":"10.1016\/0095-8956(79)90058-3"},{"key":"837_CR16","unstructured":"Liu, Y. P.: Embeddability in graphs. Klumer Science, London (1995)"},{"key":"837_CR17","unstructured":"Nebesky L.: A new characterization of the maximum genus of a graph, Czech. Math.J., 31(106), 604\u2013613 (1981)"},{"key":"837_CR18","doi-asserted-by":"crossref","unstructured":"Huang, Y. Q., Liu, Y. P.: Maximum genus and chromatic number of graphs. Discrete Math. 271, 117\u2013127 (2003)","DOI":"10.1016\/S0012-365X(03)00289-9"},{"key":"837_CR19","unstructured":"Chen, Y. C., Liu, Y. P.: Maximum genus, girth and maximum nonadjacent edge set. Ars Combinatoria 79, 145\u2013159 (2006)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0837-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0837-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0837-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T03:28:41Z","timestamp":1633490921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0837-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["837"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0837-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}