{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:40Z","timestamp":1740107140853,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,5,28]],"date-time":"2017-05-28T00:00:00Z","timestamp":1495929600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00373-017-1788-1","type":"journal-article","created":{"date-parts":[[2017,5,28]],"date-time":"2017-05-28T05:47:37Z","timestamp":1495950457000},"page":"1443-1450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3927-196X","authenticated-orcid":false,"given":"Seiya","family":"Negami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas W.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"1","key":"1788_CR1","doi-asserted-by":"crossref","first-page":"R16","DOI":"10.37236\/1042","volume":"13","author":"KL Collins","year":"2006","unstructured":"Collins, K.L., Trenk, A.: The distinguishing chromatic number. Electron. J. Combin. 13(1), R16 (2006)","journal-title":"Electron. J. Combin."},{"key":"1788_CR2","doi-asserted-by":"crossref","unstructured":"Fijav\u017e, G., Negami, S., Sano, T.: 3-Connected planar graphs are 5-distinguishing colorable with two exceptions. Ars Mathematica Contemporanea 4(1), 165\u2013175 (2011)","DOI":"10.26493\/1855-3974.199.a0e"},{"key":"1788_CR3","first-page":"57","volume":"61","author":"G Fijav\u017e","year":"2011","unstructured":"Fijav\u017e, G., Negami, S., Sano, T.: Distinguishing colorings of 3-connected planar graphs with five colors. Yokohama Math. J. 61, 57\u201365 (2011)","journal-title":"Yokohama Math. J."},{"key":"1788_CR4","doi-asserted-by":"crossref","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. Discrete Math. 44, 161\u2013180 (1983)","journal-title":"Discrete Math."},{"key":"1788_CR5","first-page":"179","volume":"55","author":"S Negami","year":"2010","unstructured":"Negami, S., Sakurai, S.: Distinguishing chromatic numbers of planar graphs. Yokohama Math. J. 55, 179\u2013188 (2010)","journal-title":"Yokohama Math. J."},{"key":"1788_CR6","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/j.disc.2011.10.023","volume":"312","author":"S Negami","year":"2012","unstructured":"Negami, S.: The distinguishing numbers of graphs on closed surfaces. Discrete Math. 312, 973\u2013991 (2012)","journal-title":"Discrete Math."},{"key":"1788_CR7","unstructured":"Negami, S., Noguchi, K., Tucker, T.: The distinguishing chromatic numbers of bipartite polyhedral maps and dual pairs on closed surfaces (in preparation)"},{"key":"1788_CR8","first-page":"131","volume":"206","author":"T Sano","year":"2010","unstructured":"Sano, T., Negami, S.: The distinguishing chromatic numbers of triangulations on the projective plane. Congressus Numerantium 206, 131\u2013137 (2010)","journal-title":"Congressus Numerantium"},{"key":"1788_CR9","first-page":"77","volume":"57","author":"T Sano","year":"2011","unstructured":"Sano, T.: The distinguishing chromatic number of triangulation on the sphere. Yokohama Math. J. 57, 77\u201387 (2011)","journal-title":"Yokohama Math. J."},{"key":"1788_CR10","doi-asserted-by":"crossref","unstructured":"Tucker, T.W.: Distinguishing maps. Electron. J. Combin. 18(1), #P50 (2011)","DOI":"10.37236\/537"},{"key":"1788_CR11","doi-asserted-by":"crossref","unstructured":"Tucker, T.W.: Distinguishing maps II: general cases. Electron. J. Combin. 20(2), #P50 (2013)","DOI":"10.37236\/3410"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1788-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1788-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1788-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T19:16:57Z","timestamp":1602184617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1788-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,28]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1788"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1788-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,5,28]]}}}