{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:42:28Z","timestamp":1756809748090},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_35","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"319-328","source":"Crossref","is-referenced-by-count":3,"title":["New Bounds on the Number of Edges in a k-Map Graph"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.2001.1178","volume":"41","author":"Z.-Z. Chen","year":"2001","unstructured":"Chen, Z.-Z.: Approximation algorithms for independent sets in map graphs. J. Algorithms\u00a041, 20\u201340 (2001)","journal-title":"J. Algorithms"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 514\u2013523 (1998)","DOI":"10.1145\/276698.276865"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1145\/506147.506148","volume":"49","author":"Z.-Z. Chen","year":"2002","unstructured":"Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM\u00a049, 127\u2013138 (2002)","journal-title":"J. ACM"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2001.2046","volume":"83","author":"D.P. Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: A new bound on the cyclic chromatic number. J. Combinatorial Theory Ser. B\u00a083, 102\u2013111 (2001)","journal-title":"J. Combinatorial Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:36Z","timestamp":1620012396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}