Asymptotically optimal tree-packings in regular graphs.
Kelmans, Alexander, Mubayi, Dhruv, Sudakov, Benny (2001)
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 Uniquely Embeddable Forests”
Asymptotically optimal tree-packings in regular graphs.
A note on packing graphs without cycles of length up to five.
Görlich, Agnieszka, Żak, Andrzej (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the union of matching matroids
Martin Loebl, Svatopluk Poljak (1988)
Mathematica Slovaca
Similarity:
On self-complementary cyclic packing of forests.
Wojda, A.Pawel, Wozniak, Mariusz, Ziolo, Irmina A. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On local properties of graphs again
Jiří Sedláček (1989)
Časopis pro pěstování matematiky
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Repetition number of graphs.
Caro, Yair, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: