Sand drawings and Gaussian graphs
暂无分享,去创建一个
Erik D. Demaine | Godfried T. Toussaint | Martin L. Demaine | Perouz Taslakian | G. Toussaint | E. Demaine | M. Demaine | Perouz Taslakian
[1] Claudia Zaslavsky,et al. Africa Counts: Number and Pattern in African Cultures , 1973 .
[2] M. Ascher. Malekula Sand Tracings: A Case in Ethnomathematics , 2005 .
[3] Hans Rademacher,et al. Enjoyment of Mathematics: Selections from Mathematics for the Amateur , 1957 .
[4] Valery A. Liskovets,et al. Enumeration of eulerian and unicursal planar maps , 2004, Discret. Math..
[5] D. Ness. Paulus Gerdes. Sona Geometry from Angola: mathematics of an African tradition , 2007 .
[6] R. Otter. The Number of Trees , 1948 .
[7] F. J. Craveiro de Carvalho,et al. Characterizing Maximally Looped Closed Curves , 1985 .
[8] Marcia Ascher,et al. Ethnomathematics: A Multicultural View of Mathematical Ideas , 1992 .
[9] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[10] J. W. Kennedy,et al. A note on Gaussian graphs , 1995 .
[11] Nicolas Bonichon,et al. Planar Graphs, via Well-Orderly Maps and Trees , 2004, WG.
[12] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .
[13] Paulus Gerdes,et al. Geometry from Africa | Mathematical and Educational Explorations , 2022 .
[14] Königlichen Gesellschaft der Wissenschaften. Zur Geometrie der Lage, für zwei Raumdimensionen , 1900 .
[15] Th. Motzkin. The Euclidean algorithm , 1949 .
[16] T. Ozawa. On Halpern’s conjecture for closed plane curves , 1984 .
[17] Erik D. Demaine,et al. Curves in the Sand: Algorithmic Drawing , 2006, CCCG.
[18] Paulus Gerdes,et al. Geometry from Africa , 1999 .
[19] V. Arnold. Topological Invariants of Plane Curves and Caustics , 1994 .
[20] Godfried T. Toussaint,et al. The Euclidean Algorithm Generates Traditional Musical Rhythms , 2005 .
[21] Victor J. Katz,et al. Mathematics Elsewhere : An Exploration of Ideas Across Cultures , 2003 .
[22] Julius v. Sz. Nagy. Über ein topologisches Problem von Gauß , 1927 .
[23] John M. Boyer,et al. On the Cutting Edge: Simplified O(n) Planarity by Edge Addition , 2004, J. Graph Algorithms Appl..