The lower tail of the random minimum spanning tree.
Flaxman, Abraham D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A note on random minimum length spanning trees.”
The lower tail of the random minimum spanning tree.
Large bounded degree trees in expanding graphs.
Balogh, József, Csaba, Béla, Pei, Martin, Samotij, Wojciech (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the size of a maximal induced tree in a random graph
Michał Karoński, Zbigniew Palka (1980)
Mathematica Slovaca
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Coloring the edges of a random graph without a monochromatic giant component.
Spöhel, Reto, Steger, Angelika, Thomas, Henning (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Balanced aspect ratio trees and their use for drawing large graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Finite graphs and their spanning trees
Jiří Sedláček (1967)
Časopis pro pěstování matematiky
Similarity:
Building graphs from colored trees.
Esselstein, Rachel M., Winkler, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: