Saturation numbers for trees.
Faudree, Jill, Faudree, Ralph J., Gould, Ronald J., Jacobson, Michael S. (2009)
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Ends in uniform spanning forests.”
Saturation numbers for trees.
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
The number of -matchings in almost every tree is a zero residue.
Alon, Noga, Haber, Simi, Krivelevich, Michael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Quartet compatibility and the quartet graph.
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of genus one labeled circle trees.
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the kernel of tree incidence matrices.
Bauer, Michael, Golinelli, Oliver (2000)
Journal of Integer Sequences [electronic only]
Similarity:
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graceful tree conjecture for infinite trees.
Chan, Tsz Lung, Cheung, Wai Shun, Ng, Tuen Wai (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The block connectivity of random trees.
McGrae, Andrew R.A., Zito, Michele (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: