| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654749 | European Journal of Combinatorics | 2008 | 10 Pages |
Abstract
We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sa’ar Hersonsky,