{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:30:28Z","timestamp":1766377828009},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_25","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"254-265","source":"Crossref","is-referenced-by-count":11,"title":["Drawing Cubic Graphs with the Four Basic Slopes"],"prefix":"10.1007","author":[{"given":"Padmini","family":"Mukkamala","sequence":"first","affiliation":[]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"http:\/\/www.mathe2.uni-bayreuth.de\/markus\/reggraphs.html"},{"key":"25_CR2","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Tableofsimplecubicgraphs"},{"issue":"12","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.disc.2006.03.002","volume":"306","author":"G. Ambrus","year":"2006","unstructured":"Ambrus, G., Bar\u00e1t, J.: A contribution to queens graphs: A substitution method. Discrete Mathematics\u00a0306(12), 1105\u20131114 (2006)","journal-title":"Discrete Mathematics"},{"key":"25_CR4","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, 875\u2013889 (2006)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-11805-0_5","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the Perspectives Opened By Right Angle Crossing Drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 21\u201332. Springer, Heidelberg (2010)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.D.: Graphs that Admit Right Angle Crossing Drawings. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 135\u2013146. Springer, Heidelberg (2010)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matousek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb.\u00a013(1) (2006)","DOI":"10.37236\/1029"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J. Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for n-queens. Discrete Mathematics\u00a0309, 1\u201331 (2009)","journal-title":"Discrete Mathematics"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing Graphs With Right Angle Crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"3","key":"25_CR10","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."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V. Dujmovic","year":"2007","unstructured":"Dujmovic, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom.\u00a038(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V. Dujmovic","year":"2007","unstructured":"Dujmovic, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discrete & Computational Geometry\u00a037(4), 641\u2013670 (2007)","journal-title":"Discrete & Computational Geometry"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Snoeyink, J., Boissonnat, J.-D. (eds.) Symposium on Computational Geometry, pp. 340\u2013346. ACM (2004)","DOI":"10.1145\/997817.997868"},{"key":"25_CR15","unstructured":"Engelstein, M.: Drawing graphs with few slopes. Intel Competition for high school students (2005)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-36151-0_15","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2002","unstructured":"Eppstein, D.: Separating Thickness From Geometric Thickness. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 150\u2013161. Springer, Heidelberg (2002)"},{"issue":"3","key":"25_CR17","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(3), 161\u2013171 (1999)","journal-title":"Comput. Geom."},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-11805-0_29","volume-title":"Graph Drawing","author":"V. Jel\u00ednek","year":"2010","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesa\u0159, M., Vysko\u010dil, T.: The Planar Slope Number Of Planar Partial 3-Trees Of Bounded Degree. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 304\u2013315. Springer, Heidelberg (2010)"},{"key":"25_CR19","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":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-18469-7_27","volume-title":"Graph Drawing","author":"B. Keszegh","year":"2011","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing Planar Graphs of Bounded Degree With Few Slopes. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 293\u2013304. Springer, Heidelberg (2011)"},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comgeo.2007.05.003","volume":"40","author":"B. Keszegh","year":"2008","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing cubic graphs with at most five slopes. Comput. Geom.\u00a040(2), 138\u2013147 (2008)","journal-title":"Comput. Geom."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00196","volume":"14","author":"B. Keszegh","year":"2010","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl.\u00a014(1), 5\u201317 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G","volume":"30","author":"M. Meringer","year":"1999","unstructured":"Meringer, M.: Fast generation of regular graphs and construction of cages. J. Graph Theory\u00a030, 137\u2013146 (1999)","journal-title":"J. Graph Theory"},{"key":"25_CR24","unstructured":"Mukkamala, P.: Obstacles, Slopes and Tic-Tac-Toe: An excursion in discrete geomety and combinatorial game theory. PhD thesis, Rutgers, The State University of New Jersey (2011), http:\/\/arxiv.org\/abs\/1106.1973"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. CoRR, abs\/1106.1973 (2011)","DOI":"10.1007\/978-3-642-25878-7_25"},{"issue":"9","key":"25_CR26","doi-asserted-by":"publisher","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. Comput. Geom.\u00a042(9), 842\u2013851 (2009)","journal-title":"Comput. Geom."},{"key":"25_CR27","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."},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Comb.\u00a013(1) (2006)","DOI":"10.37236\/1139"},{"issue":"2","key":"25_CR29","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(2), 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-25878-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T21:15:21Z","timestamp":1593378921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}