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.
Original language | English |
---|---|
Pages (from-to) | 208-217 |
Number of pages | 10 |
Journal | European Journal of Combinatorics |
Volume | 29 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2008 |
Externally published | Yes |
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics