{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:12Z","timestamp":1720640772647},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00076-9","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"322-329","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The Maximum Genus of a Graph with Given Diameter and Connectivity"],"prefix":"10.1016","volume":"11","author":[{"given":"Hung-Lin","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Chun","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB1","series-title":"Graphs and Digraphs","author":"Behzand","year":"1979"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00336-H","article-title":"Maximum genus and connectivity","volume":"149","author":"Chen","year":"1996","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB3","first-page":"187","article-title":"The maximum genus of diameter three graphs","volume":"14","author":"Fu","year":"1996","journal-title":"Australasian J. of Combinatorics"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0012-365X(00)00130-8","article-title":"The decay number and the maximum genus of diameter 2 graphs","volume":"226","author":"Fu","year":"2001","journal-title":"Discrete Math"},{"issue":"123","key":"10.1016\/S1571-0653(04)00076-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1022845722159","article-title":"The maximum genus, matchings and the cycle space of a graph","volume":"48","author":"Fu","year":"1998","journal-title":"Czechoslovak Math. J"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB6","first-page":"401","article-title":"A characterizaton of upper embeddable graphs","volume":"241","author":"Jungerman","year":"1978","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB7","unstructured":"S. P. Kanchi and J. Chen, A tight lower bound on the maximum genus of a 2-connected simplicial graph, manuscript (1992)."},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB8","first-page":"180","article-title":"The maximum genus of a graph, \u03c7-Transformations of Graphs","author":"Khomemko","year":"1973","journal-title":"Inst. Mat. Akad. Nauk Ukrain. SSR"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","article-title":"Bounds on number of disjoint spanning trees","volume":"19","author":"Kundu","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"issue":"106","key":"10.1016\/S1571-0653(04)00076-9_NEWBIB10","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":"Czechosolvak Math. J"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(91)90046-5","article-title":"The maximum genus of graphs of diameter 2","volume":"87","author":"S\u0306koviera","year":"1991","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB12","first-page":"391","article-title":"The decay number and the maximum genus of a graph","volume":"4","author":"S\u0306koviera","year":"1992","journal-title":"Math. Slovaca 42 No"},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB13","unstructured":"M. C. Tsai, A study of maximum genus via diameter, Ph. D. thesis, 1996, National Chiao Tung University, Hsin Chu, Tainwan, R.O.C."},{"key":"10.1016\/S1571-0653(04)00076-9_NEWBIB14","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":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000769?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000769?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T15:54:06Z","timestamp":1624722846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":14,"alternative-id":["S1571065304000769"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00076-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}