## Abstract We show that every plane graph of diameter 2__r__ in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius __r__. ยฉ 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65โ80, 2003
โฆ LIBER โฆ
f-Vectors of Triangulated Balls
โ Scribed by Samuel Kolins
- Publisher
- Springer
- Year
- 2010
- Tongue
- English
- Weight
- 645 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On covering bridged plane triangulations
โ
Victor Chepoi; Yann Vaxรจs
๐
Article
๐
2003
๐
John Wiley and Sons
๐
English
โ 155 KB
f-vectors and h-vectors of simplicial po
โ
Richard P. Stanley
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 880 KB
โ
Tara Lain
๐
Fiction
๐
English
โ 198 KB
๐ 1 views
ฦ-Vectors of acyclic complexes
โ
Gil Kalai
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 128 KB
A simplicial complex C is acyclic if C is connected and H,(C) = 0 for all i > 0. (Hi(C) is the ith homology group of C.) l-dimensional acyclic complexes are just trees which were extensively studied in the combinatorial literature. However, the combinatorial properties of high-dimensional acyclic co
f-Vectors of barycentric subdivisions
โ
Francesco Brenti; Volkmar Welker
๐
Article
๐
2007
๐
Springer-Verlag
๐
French
โ 254 KB
On a triangulation of the 3-ball and the
โ
Geยดza Bohus; William Jockusch; Carl W. Lee; Nagabhushana Prabhu
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 302 KB
We show that neither the 3-ball nor the solid torus admits a triangulation in which (i) every vertex is on the boundary, and (ii) every tetrahedron has exactly one triangle on the boundary. Such triangulations are relevant to an unresolved conjecture of Perles.