On the cover time of planar graphs.
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
Similarity:
Jonasson, Johan, Schramm, Oded (2000)
Electronic Communications in Probability [electronic only]
Similarity:
Kelmans, Alexander, Mubayi, Dhruv, Sudakov, Benny (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Justyna Otfinowska, Mariusz Woźniak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ramin Imany-Nabiyyi (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...
Molloy, Michael, Reed, Bruce (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Amini, Hamed (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tomasz Dubejko (1996-1997)
Séminaire de théorie spectrale et géométrie
Similarity:
Aldous, David J., Lyons, Russell (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity: