Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities.”
Relaxed graceful labellings of trees.
Quartet compatibility and the quartet graph.
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [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:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition.
Li, Xueliang, Liu, Fengxia (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bases of classes of trees closed under subdivisions
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees.
Schaeffer, Gilles (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity: