{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:37:44Z","timestamp":1794559064096,"version":"4.9.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_39","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"506-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"1\u20133","key":"39_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Math. 229(1\u20133), 101\u2013124 (2001)","journal-title":"Discrete Math."},{"key":"39_CR2","unstructured":"Pisanski, T., Randi\u0107, M.: Bridges between geometry and graph theory. In: Gorini, C.A. (ed.) Geometry at Work. MAA Notes, vol. 53, pp. 174\u2013194. Cambridge University Press (2000)"},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H de Fraysseix","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Comb. Probab. Comput. 3(2), 233\u2013246 (1994)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"A8","DOI":"10.1145\/1328911.1328919","volume":"4","author":"AL Buchsbaum","year":"2008","unstructured":"Buchsbaum, A.L., Gansner, E.R., Procopiuc, C.M., Venkatasubramanian, S.: Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1), A8 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-27261-0_20","volume-title":"Graph Drawing and Network Visualization","author":"J Klawitter","year":"2015","unstructured":"Klawitter, J., N\u00f6llenburg, M., Ueckerdt, T.: Combinatorial properties of triangle-free rectangle arrangements and the squarability problem. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 231\u2013244. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_20"},{"issue":"1\u20133","key":"39_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0012-365X(00)00263-6","volume":"235","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P.: Contact graphs of line segments are NP-complete. Discrete Math. 235(1\u20133), 95\u2013106 (2001)","journal-title":"Discrete Math."},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-21840-3_1","volume-title":"Algorithms and Data Structures","author":"MJ Alam","year":"2015","unstructured":"Alam, M.J., Eppstein, D., Kaufmann, M., Kobourov, S.G., Pupyrev, S., Schulz, A., Ueckerdt, T.: Contact graphs of circular arcs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 1\u201313. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_1"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/PL00009381","volume":"20","author":"G Csizmadia","year":"1998","unstructured":"Csizmadia, G.: On the independence number of minimum distance graphs. Discrete Comput. Geom. 20(2), 179\u2013187 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"39_CR9","first-page":"28","volume":"19","author":"KJ Swanepoel","year":"2009","unstructured":"Swanepoel, K.J.: Triangle-free minimum distance graphs in the plane. Geombinatorics 19(1), 28\u201330 (2009)","journal-title":"Geombinatorics"},{"key":"39_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-27261-0_37","volume-title":"Graph Drawing and Network Visualization","author":"C Bowen","year":"2015","unstructured":"Bowen, C., Durocher, S., L\u00f6ffler, M., Rounds, A., Schulz, A., T\u00f3th, C.D.: Realization of Simply connected polygonal linkages and recognition of unit disk contact trees. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 447\u2013459. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_37"},{"key":"39_CR11","unstructured":"Hartsfield, N., Ringel, G.: Problem 8.4.8. In: Pearls in Graph Theory: A Comprehensive Introduction. Dover Books on Mathematics, pp. 177\u2013178. Courier Corporation (2003)"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Miller, G.L. (ed.) Proceedings of the 28th ACM Symposium on Theory of Computing (STOC 1996), pp. 571\u2013575. Association for Computing Machinery (1996)","DOI":"10.1145\/237814.238005"},{"key":"39_CR13","first-page":"14","volume":"29","author":"H Harborth","year":"1974","unstructured":"Harborth, H.: L\u00f6sung zu problem 664A. Elemente der Mathematik 29, 14\u201315 (1974)","journal-title":"Elemente der Mathematik"},{"key":"39_CR14","unstructured":"Kupitz, Y.S.: On the maximal number of appearances of the minimal distance among $$n$$ points in the plane. In: B\u00f6r\u00f6czky, K., T\u00f3th, G.F. (eds.) Intuitive Geometry: Papers from the Third International Conference. Colloq. Math. Soc. J\u00e1nos Bolyai, Szeged, 2\u20137 September 1991, vol. 63, pp. 217\u2013244, North-Holland (1994)"},{"issue":"3","key":"39_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory Ser. A 114(3), 563\u2013571 (2007)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"key":"39_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-36763-2_29","volume-title":"Graph Drawing","author":"FJ Brandenburg","year":"2013","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the density of maximal 1-Planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 327\u2013338. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_29"},{"issue":"1","key":"39_CR18","doi-asserted-by":"crossref","first-page":"R136","DOI":"10.37236\/408","volume":"17","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D.: Densities of minor-closed graph families. Electron. J. Comb. 17(1), R136 (2010)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"39_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2015.06.001","volume":"50","author":"A Suk","year":"2015","unstructured":"Suk, A., Walczak, B.: New bounds on the maximum number of edges in $$k$$-quasi-planar graphs. Comput. Geom. Theory Appl. 50, 24\u201333 (2015)","journal-title":"Comput. Geom. Theory Appl."},{"key":"39_CR21","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch, H.: Zur Theorie der diskreten Gebilde, VII: Ein Dreifarbensatz f\u00fcr dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-U. Halle-Wittenberg Math. Nat. Reihe 8, 109\u2013120 (1959)","journal-title":"Wiss. Z. Martin-Luther-U. Halle-Wittenberg Math. Nat. Reihe"},{"issue":"1","key":"39_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0095-8956(03)00029-7","volume":"88","author":"C Thomassen","year":"2003","unstructured":"Thomassen, C.: A short list color proof of Gr\u00f6tzsch\u2019s theorem. J. Comb. Theory Ser. B 88(1), 189\u2013192 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Kawarabayashi, K., Thomas, R.: Three-coloring triangle-free planar graphs in linear time. In: Mathieu, C. (ed.) Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 1176\u20131182. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.127"},{"issue":"1\u20133","key":"39_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0012-365X(94)00180-9","volume":"146","author":"M Voigt","year":"1995","unstructured":"Voigt, M.: A not $$3$$-choosable planar graph without $$3$$-cycles. Discrete Math. 146(1\u20133), 325\u2013328 (1995)","journal-title":"Discrete Math."},{"issue":"2","key":"39_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12(2), 125\u2013134 (1992)","journal-title":"Combinatorica"},{"issue":"3","key":"39_CR26","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1137\/080743020","volume":"24","author":"Z Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, Z., Lidick\u00fd, B., \u0160krekovski, R.: 3-choosability of triangle-free planar graphs with constraint on 4-cycles. SIAM J. Discrete Math. 24(3), 934\u2013945 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"39_CR27","first-page":"247","volume":"24","author":"L Bieberbach","year":"1915","unstructured":"Bieberbach, L.: \u00dcber eine Extremaleigenschaft des Kreises. Jber. Deutsch. Math. Verein. 24, 247\u2013250 (1915)","journal-title":"Jber. Deutsch. Math. Verein."},{"issue":"4","key":"39_CR28","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1137\/090760301","volume":"24","author":"HJ Bandelt","year":"2010","unstructured":"Bandelt, H.J., Chepoi, V., Eppstein, D.: Combinatorics and geometry of finite and infinite squaregraphs. SIAM J. Discrete Math. 24(4), 1399\u20131440 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Triangle-Free penny graphs: degeneracy, choosability, and edge count. Electronic preprint arXiv:1708.05152 (2017)","DOI":"10.1007\/978-3-319-73915-1_39"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:25:42Z","timestamp":1710228342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_39","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}