{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:38:23Z","timestamp":1774723103531,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":9263,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1016\/s0195-6698(88)80012-x","type":"journal-article","created":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T12:46:20Z","timestamp":1378730780000},"page":"215-224","source":"Crossref","is-referenced-by-count":21,"title":["The Maximum Genus of Graph Bundles"],"prefix":"10.1016","volume":"9","author":[{"given":"Bojan","family":"Mohar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toma\u017e","family":"Pisanski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"\u0160koviera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(88)80012-X_bib1","series-title":"Genre maximum d'un \u0394-graphe, Colloques internationaux C.N.R.S. No 260","first-page":"57","author":"Bouchet","year":"1976"},{"key":"10.1016\/S0195-6698(88)80012-X_bib2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(77)90131-5","article-title":"Generating all graph coverings by permutation voltage assignments","volume":"18","author":"Gross","year":"1977","journal-title":"Discrete Math"},{"key":"10.1016\/S0195-6698(88)80012-X_bib3","first-page":"401","article-title":"Characterization of upper-embeddable graphs","volume":"241","author":"Jungerman","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0195-6698(88)80012-X_bib4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","article-title":"Bounds on the number of disjoint spanning trees","volume":"17","author":"Kundu","year":"1976","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"31","key":"10.1016\/S0195-6698(88)80012-X_bib5","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":"106","author":"Nebesky","year":"1981","journal-title":"Czechoslovak Math. J"},{"key":"10.1016\/S0195-6698(88)80012-X_bib6","series-title":"Math. Inst. Ukr. Acad. Sci., Kiev","first-page":"211","article-title":"The maximum genus of Cartesian, strong and lexicographic products of two graphs","author":"Ostroverhii","year":"1973"},{"key":"10.1016\/S0195-6698(88)80012-X_bib7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(83)90076-X","article-title":"Edge-colorability of graph bundles","volume":"35","author":"Pisanski","year":"1983","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0195-6698(88)80012-X_bib8","unstructured":"T. Pisanski and J. Vrabec, Graph bundles, submitted."},{"key":"10.1016\/S0195-6698(88)80012-X_bib9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","article-title":"Non-separating induced cycles in graphs","volume":"31","author":"Thomassen","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0195-6698(88)80012-X_bib10","series-title":"Selected Topics in Graph Theory","article-title":"Topological graph theory","author":"White","year":"1978"},{"key":"10.1016\/S0195-6698(88)80012-X_bib11","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"},{"key":"10.1016\/S0195-6698(88)80012-X_bib12","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.4153\/CJM-1974-096-2","article-title":"The maximum genus of cartesian products of graphs","volume":"26","author":"Zaks","year":"1974","journal-title":"Canad. J. Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566988880012X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566988880012X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T19:35:27Z","timestamp":1646508927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019566988880012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["S019566988880012X"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(88)80012-x","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}