On covering bridged plane triangulations with balls

Abstract

We show that every plane graph of diameter 2r 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:

DOI: 10.1002/jgt.10130

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@article{Chepoi2003OnCB, title={On covering bridged plane triangulations with balls}, author={Victor Chepoi and Yann Vax{\`e}s}, journal={Journal of Graph Theory}, year={2003}, volume={44}, pages={65-80} }