Related content

Non-Crossing Frameworks with Non-Crossing Reciprocals

By Orden David   Rote Günter   Santos Francisco   Servatius Brigitte   Servatius Herman   Whiteley Walter  

Discrete & Computational Geometry, Vol. 32, Iss. 4, 2004-11 ,pp. : 567-600

Springer Publishing Company

Access to resources Recommend Favorite

Simply Generated Non-Crossing Partitions

By  

Combinatorics, Probability & Computing, Vol. 26, Iss. 4, 2017-07 ,pp. : 560-592

Cambridge University Press

Access to resources Recommend Favorite

A basis for the non-crossing partition lattice top homology

By Zoque Eliana  

Journal of Algebraic Combinatorics, Vol. 23, Iss. 3, 2006-05 ,pp. : 231-242

Springer Publishing Company

Access to resources Recommend Favorite

Fast Enumeration Algorithms for Non-crossing Geometric Graphs

By Katoh Naoki   Tanigawa Shin-Ichi  

Discrete & Computational Geometry, Vol. 42, Iss. 3, 2009-10 ,pp. : 443-468

Springer Publishing Company

Access to resources Recommend Favorite

The Number of Embeddings of Minimally Rigid Graphs

By Borcea Ciprian   Streinu Ileana  

Discrete & Computational Geometry, Vol. 31, Iss. 2, 2004-02 ,pp. : 287-303

Springer Publishing Company

Access to resources Recommend Favorite