{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:43Z","timestamp":1725524623898},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_6","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"50-60","source":"Crossref","is-referenced-by-count":0,"title":["Cubic Graphs Have Bounded Slope Parameter"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3\u20134","key":"6_CR1","first-page":"875","volume":"72","author":"G. Ambrus","year":"2006","unstructured":"Ambrus, G., Bar\u00e1t, J., Hajnal, P.: The slope parameter of graphs. Acta Sci. Math.(Szeged)\u00a072(3\u20134), 875\u2013889 (2006)","journal-title":"Acta Sci. Math.(Szeged)"},{"issue":"1","key":"6_CR2","first-page":"14","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. Electr. J. Combin.\u00a013(1), R3, 14pp. (2006)","journal-title":"Electr. J. Combin."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"M.B. Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl.\u00a04(3), 5\u201317 (2000)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR4","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. Comput. Geom.\u00a038, 181\u2013193 (2007)","journal-title":"Comput. Geom."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11618058_13","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2006","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 129\u2013140. Springer, Heidelberg (2006)"},{"key":"6_CR6","first-page":"340","volume-title":"SoCG 2004","author":"C.A. Duncan","year":"2004","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: SoCG 2004, pp. 340\u2013346. ACM Press, New York (2004)"},{"key":"6_CR7","series-title":"Contemporary Math","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/conm\/342\/06132","volume-title":"Towards a Theory of Geometric Graphs","author":"D. Eppstein","year":"2004","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Math, vol.\u00a0342, pp. 75\u201386. AMS, Providence (2004)"},{"key":"6_CR8","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":"6_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0925-7721(99)00018-8","volume":"13","author":"J.P. Hutchinson","year":"1999","unstructured":"Hutchinson, J.P., Shermer, T.C., Vince, A.: On representations of some thickness-two graphs. Comput. Geom.\u00a013, 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0012-365X(86)90012-9","volume":"60","author":"R.E. Jamison","year":"1986","unstructured":"Jamison, R.E.: Few slopes without collinearity. Discrete Math.\u00a060, 199\u2013206 (1986)","journal-title":"Discrete Math."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02992822","volume":"39","author":"P.C. Kainen","year":"1973","unstructured":"Kainen, P.C.: Thickness and coarseness of graphs. Abh. Math. Sem. Univ. Hamburg\u00a039, 88\u201395 (1973)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"6_CR12","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":"6_CR13","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions (manuscript, 2007)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/PL00007219","volume":"14","author":"P. Mutzel","year":"1998","unstructured":"Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Combin.\u00a014, 59\u201373 (1998)","journal-title":"Graphs Combin."},{"issue":"1","key":"6_CR15","first-page":"4","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), Note 1, 4pp. (2006)","journal-title":"Electr. J. Combin."},{"key":"6_CR16","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. The Computer J.\u00a037, 139\u2013142 (1994)","journal-title":"The Computer 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-00219-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T23:54:33Z","timestamp":1551743673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}