You have Guest access.
Log In
Volume 1 / 1986 - Volume 47 / 2012
273-281
How Neighborly Can a Centrally Symmetric Polytope Be?
Nathan Linial and Isabella Novik
283-311
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs
Seok-Hee Hong, Brendan McKay and Peter Eades
313-329
Homotopy Type of Complexes of Graph Homomorphisms between Cycles
Sonja Lj. Cukic and Dmitry N. Kozlov
331-361
A Geometric Study of the Split Decomposition
Hiroshi Hirai
363-379
Isodiametric Problems for Polygons
Michael J. Mossinghoff
381-390
There Is No Face-to-Face Partition of R5 into Acute Simplices
Michal Krizek
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info