{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:58Z","timestamp":1740107098175,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["17K14239"],"award-info":[{"award-number":["17K14239"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19J13359"],"award-info":[{"award-number":["19J13359"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00373-020-02256-8","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T06:04:48Z","timestamp":1605506688000},"page":"435-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Embeddings of a Graph into a Surface with Different Weak Chromatic Numbers"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6729-3958","authenticated-orcid":false,"given":"Kengo","family":"Enami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7790-0782","authenticated-orcid":false,"given":"Kenta","family":"Noguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"2256_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1006\/jctb.1995.1015","volume":"63","author":"JL Arocha","year":"1995","unstructured":"Arocha, J.L., Bracho, J., Neumann-Lara, V.: Tight and untight triangulations of surfaces by complete graphs. J. Combin. Theory Ser. B 63, 185\u2013199 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2256_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/0603023","volume":"3","author":"M De Brandes","year":"1982","unstructured":"De Brandes, M., Phelps, K.T., R\u00f6dl, V.: Coloring steiner triple systems. SIAM J. Algebr. Discret. Methods 3, 241\u2013249 (1982)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"2256_CR3","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.1016\/j.disc.2016.07.026","volume":"340","author":"J Czap","year":"2017","unstructured":"Czap, J., Jendrol\u2019, S.: Facially-constrained colorings of plane graphs: a survey. Discret. Math. 340, 2691\u20132703 (2017)","journal-title":"Discret. Math."},{"key":"2256_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ejc.2004.01.003","volume":"26","author":"Z Dvo\u0159\u00e1k","year":"2005","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., \u0160krekovski, R.: Coloring face hypergraphs on surfaces. Eur. J. Combin. 26, 95\u2013110 (2005)","journal-title":"Eur. J. Combin."},{"key":"2256_CR5","volume-title":"Topological graph theory","author":"JL Gross","year":"1987","unstructured":"Gross, J.L., Tucker, T.W.: Topological graph theory. Wiley, New York (1987)"},{"key":"2256_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1006\/jctb.2001.2107","volume":"85","author":"A K\u00fcndgen","year":"2002","unstructured":"K\u00fcndgen, A., Ramamurthi, R.: Coloring face-hypergraphs of graphs on surfaces. J. Combin. Theory Ser. B 85, 307\u2013337 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2256_CR7","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. The Johns Hopskins University Press, Baltimore (2001)"},{"key":"2256_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.22400","volume":"90","author":"A Nakamoto","year":"2019","unstructured":"Nakamoto, A., Noguchi, K., Ozeki, K.: Spanning bipartite quadrangulations of even triangulations. J. Graph Theory 90, 267\u2013287 (2019)","journal-title":"J. Graph Theory"},{"key":"2256_CR9","first-page":"25","volume":"43","author":"S Negami","year":"1996","unstructured":"Negami, S., Midorikawa, T.: Loosely-tightness of triangulations of closed surface. Sci. Rep. Yokohama Nat. Univ. Sect. I Math. Phys. Chem. 43, 25\u201341 (1996)","journal-title":"Sci. Rep. Yokohama Nat. Univ. Sect. I Math. Phys. Chem."},{"key":"2256_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(83)90057-2","volume":"44","author":"S Negami","year":"1983","unstructured":"Negami, S.: Uniqueness and faithfulness of embedding of toroidal graphs. Discret. Math. 44, 161\u2013180 (1983)","journal-title":"Discret. Math."},{"key":"2256_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.disc.2005.01.010","volume":"303","author":"S Negami","year":"2005","unstructured":"Negami, S.: Looseness ranges of triangulations on closed surface. Discret. Math. 303, 167\u2013174 (2005)","journal-title":"Discret. Math."},{"key":"2256_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.disc.2003.09.001","volume":"274","author":"R Ramamurthi","year":"2004","unstructured":"Ramamurthi, R., West, D.B.: Maximum face-constrained colorings of plane graphs. Discret. Math. 274, 233\u2013240 (2004)","journal-title":"Discret. Math."},{"key":"2256_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65759-7","volume-title":"Map color theorem","author":"G Ringel","year":"1974","unstructured":"Ringel, G.: Map color theorem. Springer, Berlin (1974)"},{"key":"2256_CR14","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1016\/j.disc.2018.12.023","volume":"342","author":"T Sun","year":"2019","unstructured":"Sun, T.: A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices. Discret. Math. 342, 1147\u20131151 (2019)","journal-title":"Discret. Math."},{"key":"2256_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"26","author":"NH Xuong","year":"1979","unstructured":"Xuong, N.H.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26, 217\u2013225 (1979)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02256-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02256-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02256-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T11:07:49Z","timestamp":1697108869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02256-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2256"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02256-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"22 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}