Toughness and Delaunay triangulations-Reference-Cited by-同舟云学术

Toughness and Delaunay triangulations

Published:1990-12 Issue:6 Volume:5 Page:575-601
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Dillencourt Michael B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02187810.pdf

Reference47 articles.

1. S. G. Akl. A note on Euclidean matchings, triangulations, and spanning trees.Journal of Combinatorics, Information and System Sciences,8(3):169–174, 1983.

2. P. F. Ash and E. D. Bolker. Recognizing Dirichlet tessellations.Geometriae Dedicata,19(2):175–206, November 1985.

3. P. F. Ash and E. D. Bolker. Generalized Dirichlet tesselations.Geometriae Dedicata,20(2):209–243, April 1986.

4. C. A. Barefoot, R. Entringer, and H. Swart. Vulnerability in graphs—a comparative survey.Journal of Combinatorial Mathematics and Combinatorial Computing,1:13–22, 1987.

5. D. Barnette and E. Jucovič. Hamiltonian circuits on 3-polytopes.Journal of Combinatorial Theory,9(1):54–59, July 1970.

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Affine invariant triangulations;Computer Aided Geometric Design;2021-11

2. Matchings in 1‐planar graphs with large minimum degree;Journal of Graph Theory;2021-09

3. Cutting path optimization for an automatic cutter in polynomial time using a 3/2 approximation algorithm;The International Journal of Advanced Manufacturing Technology;2021-03-08

4. Hamiltonicity for convex shape Delaunay and Gabriel graphs;Computational Geometry;2020-08

5. Maximum Matchings and Minimum Blocking Sets in $$\varTheta _6$$ -Graphs;Graph-Theoretic Concepts in Computer Science;2019