On a condition for the union of spherical caps to be connected

Journal of Combinatorial Theory. Series A

Volumn 101, Issue 2, 2003, Pages 264-270

  Maehara, H ^a  

^a UNIVERSITY OF THE RYUKYUS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037301659     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-3165(02)00008-0     Document Type: Article

References (7)

1. M. Behzad, G. Chartrand, L. Lesmak-Foster, Graphs & Digraphs, Prindle, Weber & Schmidt International Science, Providence, RI, 1979.
2. H. Fleischner, The square of every two-connected graph is Hamiltonian, J. Combin. Theory (B) 16 (1974) 29-34.
3. M.G. Kendall, P.A.P. Moran, Geometric Probability, Griffin, London, 1963.
4. H. Maehara, A threshold for the size of random caps to cover a sphere, Ann. Inst. Statist. Math. 40 (1988) 665-670.
5. H. Maehara, On the intersection graph of random arcs on a circle, in: M. Karoński, et al., (Eds.), Random Graphs '87, Wiley, New York, 1990, pp. 159-173.
6. L.A. Santaló, Integral Geometry and Geometric Probability, Encyclopedia of Mathematics and Its Applications, Vol, I, Addison-Wesley, Reading, MA, 1976,
7. H. Solomon, Geometric Probability, SIAM, Philadelphia, PA, 1978.