{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:07Z","timestamp":1725548947096},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_29","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T07:45:33Z","timestamp":1267775133000},"page":"304-315","source":"Crossref","is-referenced-by-count":6,"title":["The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree"],"prefix":"10.1007","author":[{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"first","affiliation":[]},{"given":"Eva","family":"Jel\u00ednkov\u00e1","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Lidick\u00fd","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Tesa\u0159","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vysko\u010dil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.37236\/1029","volume":"13","author":"J. Bar\u00e1t","year":"2006","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. The Electronic Journal of Combinatorics\u00a013, R3 (2006)","journal-title":"The Electronic Journal of Combinatorics"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-31843-9_14","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Really straight graph drawings. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 122\u2013132. Springer, Heidelberg (2005)"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Computational Geometry\u00a038(3), 181\u2013193 (2007)","journal-title":"Computational Geometry"},{"issue":"3","key":"29_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comp. Geom.-Theor. Appl.\u00a038(3), 194\u2013212 (2007)","journal-title":"Comp. Geom.-Theor. Appl."},{"key":"29_CR5","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight-line representation of planar graphs. Acta Univ. Szeged. Sect. Sci. Math.\u00a011, 229\u2013233 (1948)","journal-title":"Acta Univ. Szeged. Sect. Sci. Math."},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-70904-6_13","volume-title":"Graph Drawing","author":"B. Keszegh","year":"2007","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing cubic graphs with at most five slopes. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 114\u2013125. Springer, Heidelberg (2007)"},{"key":"29_CR7","unstructured":"Kratochv\u00edl, J., Thomas, R.: A note on planar partial 3-trees (in preparation)"},{"issue":"9","key":"29_CR8","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1016\/j.comgeo.2009.01.005","volume":"42","author":"P. Mukkamala","year":"2009","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions. Computational Geometry: Theory and Applications\u00a042(9), 842\u2013851 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"29_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1139","volume":"13","author":"J. Pach","year":"2006","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Combin.\u00a013(1), N1 (2006)","journal-title":"Electr. J. Combin."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"G.A. Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.-H.: Drawability of complete graphs using a minimal slope set. Comput. J.\u00a037, 139\u2013142 (1994)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:03Z","timestamp":1606185843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}