Dudeney, Henry (1917). Amusements in Mathematics. Edinburgh: Nelson.
Emilio Di Giacomo, Giuseppe Liotta, and Henk Meijer (2005). "Computing Straight-line 3D Grid Drawings of Graphs in Linear Volume". Comput. Geom. 32 (1): 26–58. doi:10.1016/j.comgeo.2004.11.003.CS1 maint: multiple names: authors list (link)
Vida Dujmović, Pat Morin, and David R. Wood (2005). "Layout of Graphs with Bounded Tree-Width". SIAM J. Comput. 34 (3): 553–579. doi:10.1137/S0097539702416141.CS1 maint: multiple names: authors list (link)
Stefan Felsner, Giussepe Liotta, and Stephen K. Wismath (2003). "Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions" (PDF). J. Graph Algorithms & Applications. 7 (4): 363–398.CS1 maint: multiple names: authors list (link)
Flammenkamp, Achim (1992). "Progress in the no-three-in-line problem". Journal of Combinatorial Theory, Ser. A. 60 (2): 305–311. doi:10.1016/0097-3165(92)90012-J.
Flammenkamp, Achim (1998). "Progress in the no-three-in-line problem, II". Journal of Combinatorial Theory, Ser. A. 81 (1): 108–113. doi:10.1006/jcta.1997.2829.
Guy, R. K.; Kelly, P. A. (1968). "The no-three-in-line problem". Canad. Math. Bull. 11: 527–531. MR0238765.CS1 maint: multiple names: authors list (link)
Hall, R. R.; Jackson, T. H.; Sudbery, A.; Wild, K. (1975). "Some advances in the no-three-in-line problem". Journal of Combinatorial Theory, Ser. A. 18: 336–341. doi:10.1016/0097-3165(75)90043-6.CS1 maint: multiple names: authors list (link)
Lefmann, Hanno (2008). "No l Grid-Points in spaces of small dimension". Lecture Notes in Computer Science. 5034: 259–270. doi:10.1007/978-3-540-68880-8_25.
Pach, János; Thiele, Torsten; Tóth, Géza (1998). "Three-dimensional grid drawings of graphs". Graph Drawing, 5th Int. Symp., GD '97. Lecture Notes in Computer Science, no. 1353, Springer-Verlag. pp. 47–51. doi:10.1007/3-540-63938-1_49.CS1 maint: multiple names: authors list (link)
Attila Pór and David R. Wood (2007). "No-three-in-line-in-3D". Algorithmica. 47: 481. doi:10.1007/s00453-006-0158-9.
Roth, K. F. (1951). "On a problem of Heilbronn". Journal of the London Mathematical Society. 26: 198–204. doi:10.1112/jlms/s1-26.3.198.
David R. Wood (2005). "Grid drawings of k-colourable graphs". Computational Geometry. 30 (1): 25–28. doi:10.1016/j.comgeo.2004.06.001.
แหล่งข้อมูลอื่น
Flammenkamp, Achim. "The No-Three-in-Line Problem".
ญหาไม, ดสามจ, ดเร, ยงก, บทความน, เน, อหาท, นมาก, องการเพ, มเต, มเน, อหาหร, อพ, จารณารวมเข, าก, บบทความอ, นแทน, ในทางคณ, ตศาสตร, เป, นป, ญหาท, กษาเก, ยวก, บจำนวนจ, ดมากท, ดท, สามารถวางในตารางขนาด, โดยท, ไม, ดสามจ, ดใดๆอย, บนเส, นตรงเด, ยวก, ญหาน, เร, มศ, กษาโดย. bthkhwamnimienuxhathisnmak txngkarephimetimenuxhahruxphicarnarwmekhakbbthkhwamxunaethn inthangkhnitsastr pyhaimmicudsamcuderiyngkn epnpyhathisuksaekiywkbcanwncudmakthisudthisamarthwangintarangkhnad n n odythiimmicudsamcudidxyubnesntrngediywkn pyhanierimsuksaodyehnri diwdniy inpiph s 2460cud 20 cudbnkradan 10 10 sungimmicudsamcudidxyubnesntrngediywknswnnirxephimetimkhxmul khunsamarthchwyephimkhxmulswnniidxangxing aekikhDudeney Henry 1917 Amusements in Mathematics Edinburgh Nelson Emilio Di Giacomo Giuseppe Liotta and Henk Meijer 2005 Computing Straight line 3D Grid Drawings of Graphs in Linear Volume Comput Geom 32 1 26 58 doi 10 1016 j comgeo 2004 11 003 CS1 maint multiple names authors list link Vida Dujmovic Pat Morin and David R Wood 2005 Layout of Graphs with Bounded Tree Width SIAM J Comput 34 3 553 579 doi 10 1137 S0097539702416141 CS1 maint multiple names authors list link Stefan Felsner Giussepe Liotta and Stephen K Wismath 2003 Straight Line Drawings on Restricted Integer Grids in Two and Three Dimensions PDF J Graph Algorithms amp Applications 7 4 363 398 CS1 maint multiple names authors list link Flammenkamp Achim 1992 Progress in the no three in line problem Journal of Combinatorial Theory Ser A 60 2 305 311 doi 10 1016 0097 3165 92 90012 J Flammenkamp Achim 1998 Progress in the no three in line problem II Journal of Combinatorial Theory Ser A 81 1 108 113 doi 10 1006 jcta 1997 2829 Guy R K Kelly P A 1968 The no three in line problem Canad Math Bull 11 527 531 MR0238765 CS1 maint multiple names authors list link Hall R R Jackson T H Sudbery A Wild K 1975 Some advances in the no three in line problem Journal of Combinatorial Theory Ser A 18 336 341 doi 10 1016 0097 3165 75 90043 6 CS1 maint multiple names authors list link Lefmann Hanno 2008 No l Grid Points in spaces of small dimension Lecture Notes in Computer Science 5034 259 270 doi 10 1007 978 3 540 68880 8 25 Pach Janos Thiele Torsten Toth Geza 1998 Three dimensional grid drawings of graphs Graph Drawing 5th Int Symp GD 97 Lecture Notes in Computer Science no 1353 Springer Verlag pp 47 51 doi 10 1007 3 540 63938 1 49 CS1 maint multiple names authors list link Attila Por and David R Wood 2007 No three in line in 3D Algorithmica 47 481 doi 10 1007 s00453 006 0158 9 Roth K F 1951 On a problem of Heilbronn Journal of the London Mathematical Society 26 198 204 doi 10 1112 jlms s1 26 3 198 David R Wood 2005 Grid drawings of k colourable graphs Computational Geometry 30 1 25 28 doi 10 1016 j comgeo 2004 06 001 aehlngkhxmulxun aekikhFlammenkamp Achim The No Three in Line Problem exrik dbebilyu iwssitn No Three in a Line Problem cakaemthewild bthkhwamekiywkbkhnitsastrniyngepnokhrng khunsamarthchwywikiphiediyidodyephimkhxmul duephimthi sthaniyxy khnitsastr ekhathungcak https th wikipedia org w index php title pyhaimmicudsamcuderiyngkn amp oldid 4721995, wikipedia, วิกิ หนังสือ, หนังสือ, ห้องสมุด,
