-connectivity in Abelian Cayley graphs
- 期刊名称Discrete Mathematics
- 作者Li, Hao; Li, Ping; Zhan, Mingquan; Zhang, Taoye; Zhou, Ju
- 卷第313卷
- 期第16期
- 印刷ISSN0012-365X
- 文件大小935.21KB
- 发表时间2013-8
- DOI10.1016/j.disc.2013.04.008
- 页码1666-1676
Two poset polytopesRichard P. Stanley · Discrete and Computational Geometry · 1986
Voronoi diagrams and arrangementsHerbert Edelsbrunner; Raimund Seidel · Discrete and Computational Geometry · 1986
Can you cover your shadows?H. E. Debrunner; P. Mani-Levitska · Discrete and Computational Geometry · 1986
Computing circular separabilityJoseph O'Rourke; S. Rao Kosaraju; Nimrod Megiddo · Discrete and Computational Geometry · 1986
Smooth, easy to compute interpolating splinesJohn D. Hobby · Discrete and Computational Geometry · 1986
On polyhedra with transitivity propertiesJ. M. Wills · Discrete and Computational Geometry · 1986
Approximation of convex discs by polygonsA. Florian · Discrete and Computational Geometry · 1986
Diameter partitioningDavid Avis · Discrete and Computational Geometry · 1986