On the intersection graph of random caps on a sphere

European Journal of Combinatorics

Volumn 25, Issue 5, 2004, Pages 707-718

  Maehara, H ^a  

^a UNIVERSITY OF THE RYUKYUS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1942509348     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2003.10.005     Document Type: Article

References (10)

1. Behzad M. Chartrand G. Lesniak-Foster L. Graphs & Digraphs 1979 Prindle, Weber & Schmidt International Science Providence
2. Fleischner H. The square of every two-connected graph is Hamiltonian J. Combin. Theory Ser. B 16 1974 29-34
3. Kendall M.G. Moran P.A.P. Geometric Probability 1963 Griffin London
4. Maehara H. On the intersection graph of random arcs on a circle in: Karoński M. et al. (Eds.), Random Graphs'87 1990 159-173 Wiley New York
5. Maehara H. A threshold for the size of random caps to cover a sphere Ann. Inst. Statist. Math. 40 1988 665-670
6. Maehara H. The length of the shortest edges of a graph on a sphere European J. Combin. 23 2002 713-717
7. Maehara H. On a condition for the union of spherical caps to be connected J. Combin. Theory Ser. A 101/102 2003 264-270
8. Palmer E.M. Graphical Evolution 1985 Wiley New York
9. Santaló L.A. Integral Geometry and Geometric Probability Encyclopedia of Mathematics and Its Applications, vol. I 1976 Addison-Wesley Reading, MA
10. H. Solomon, Geometric Probability, SIAM, Philadelphia, PA, 1978.