{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:18Z","timestamp":1725558858190},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_40","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"395-402","source":"Crossref","is-referenced-by-count":0,"title":["No-Three-in-Line-in-3D"],"prefix":"10.1007","author":[{"given":"Attila","family":"P\u00f3r","sequence":"first","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Math","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BFb0057371","volume-title":"Proc. 2nd Australian Conf. on Combinatorial Mathematics","author":"M.A. Adena","year":"1974","unstructured":"Adena, M.A., Holton, D.A., Kelly, P.A.: Some thoughts on the no-three-in-line problem. In: Proc. 2nd Australian Conf. on Combinatorial Mathematics. Lecture Notes in Math., vol.\u00a0403, pp. 6\u201317. Springer, Heidelberg (1974)"},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0097-3165(79)90025-6","volume":"27","author":"D.B. Anderson","year":"1979","unstructured":"Anderson, D.B.: Update on the no-three-in-line problem. J. Combin. Theory Ser. A\u00a027(3), 365\u2013366 (1979)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"40_CR3","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1112\/plms\/83.3.532","volume":"83","author":"R.C. Baker","year":"2001","unstructured":"Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes. II. Proc. London Math. Soc.\u00a083(3), 532\u2013562 (2001)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"40_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.7155\/jgaa.00079","volume":"8","author":"P. Bose","year":"2004","unstructured":"Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.: The maximum number of edges in a three-dimensional grid-drawing. J. Graph Algorithms Appl.\u00a08(1), 21\u201326 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"40_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(97)00098-7","volume":"63","author":"T. Calamoneri","year":"1997","unstructured":"Calamoneri, T., Sterbini, A.: 3D straight-line grid drawing of 4-colorable graphs. Inform. Process. Lett.\u00a063(2), 97\u2013102 (1997)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R.F. Cohen","year":"1996","unstructured":"Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Threedimensional graph drawing. Algorithmica\u00a017(2), 199\u2013208 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0097-3165(76)90030-3","volume":"20","author":"D. Craggs","year":"1976","unstructured":"Craggs, D., Hughes-Jones, R.: On the no-three-in-line problem. J. Combinatorial Theory Ser. A\u00a020(3), 363\u2013364 (1976)","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E.: Drawing series-parallel graphs on restricted integer 3D grids. In: Liotta [22], pp. 238\u2013246","DOI":"10.1007\/978-3-540-24595-7_22"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta [22], pp. 214\u2013225","DOI":"10.1007\/978-3-540-24595-7_20"},{"key":"40_CR10","unstructured":"Dudeney, H.E.: Amusements in Mathematics. Nelson, Edinburgh (1917)"},{"key":"40_CR11","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. (to appear)"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with subquadratic volume. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol.\u00a0342, pp. 55\u201366. Amer. Math. Soc. (2004)","DOI":"10.1090\/conm\/342"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1112\/jlms\/s1-9.4.282","volume":"9","author":"P. Erd\u00f6s","year":"1934","unstructured":"Erd\u00f6s, P.: A theorem of Sylvester and Schur. J. London Math. Soc.\u00a09, 282\u2013288 (1934)","journal-title":"J. London Math. Soc."},{"key":"40_CR14","first-page":"198","volume":"26","author":"P. Erd\u00f6s","year":"1951","unstructured":"Erd\u00f6s, P.: Appendix, in Klaus F. Roth. On a problem of Heilbronn. J. London Math. Soc.\u00a026, 198\u2013204 (1951)","journal-title":"On a problem of Heilbronn. J. London Math. Soc."},{"issue":"4","key":"40_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S. Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl.\u00a07(4), 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcta.1997.2829","volume":"81","author":"A. Flammenkamp","year":"1998","unstructured":"Flammenkamp, A.: Progress in the no-three-in-line problem. II. J. Combin. Theory Ser. A\u00a081(1), 108\u2013113 (1998)","journal-title":"II. J. Combin. Theory Ser. A"},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.4153\/CMB-1968-062-3","volume":"11","author":"R.K. Guy","year":"1968","unstructured":"Guy, R.K., Kelly, P.A.: The no-three-in-line problem. Canad. Math. Bull.\u00a011, 527\u2013531 (1968)","journal-title":"Canad. Math. Bull."},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/0097-3165(75)90043-6","volume":"18","author":"R.R. Hall","year":"1975","unstructured":"Hall, R.R., Jackson, T.H., Sudbery, A., Wild, K.: Some advances in the no-three-in-line problem. J. Combinatorial Theory Ser. A\u00a018, 336\u2013341 (1975)","journal-title":"J. Combinatorial Theory Ser. A"},{"issue":"1-2","key":"40_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(88)90135-5","volume":"73","author":"H. Harborth","year":"1989","unstructured":"Harborth, H., Oertel, P., Prellberg, T.: No-three-in-line for seventeen and nineteen. Discrete Math.\u00a073(1-2), 89\u201390 (1989)","journal-title":"Discrete Math"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Hasunuma, T.: Laying out iterated line digraphs using queues. In: Liotta [22], pp. 202\u2013213","DOI":"10.1007\/978-3-540-24595-7_19"},{"issue":"1","key":"40_CR21","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0097-3165(79)90055-4","volume":"26","author":"T. Kl\u00f8ve","year":"1979","unstructured":"Kl\u00f8ve, T.: On the no-three-in-line problem. III. J. Combin. Theory Ser. A\u00a026(1), 82\u201383 (1979)","journal-title":"III. J. Combin. Theory Ser. A"},{"key":"40_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2004","unstructured":"Liotta, G. (ed.): GD 2003. LNCS, vol.\u00a02912. Springer, Heidelberg (2004)"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three-dimensional grid drawings of graphs. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in discrete and computational geometry. Contemporary Mathematics, vol.\u00a0223, pp. 251\u2013255. Amer. Math. Soc. (1999)","DOI":"10.1090\/conm\/223\/03142"},{"key":"40_CR24","unstructured":"Wood, D.R.: Drawing a graph in a hypercube. Manuscript (2004)"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Grid drawings of k-colourable graphs. Comput. Geom. (to appear)","DOI":"10.1016\/j.comgeo.2004.06.001"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:20Z","timestamp":1605760100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}