Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
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 triple lacunary generating function for Hermite polynomials.”
Noncrossing trees and noncrossing graphs.
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
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:
Descents in noncrossing trees.
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting points of slope varieties over finite fields.
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
Gessel, Ira M., Sagan, Bruce E. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tree-thickness and caterpillar-thickness under girth constraints.
Liu, Qi, West, Douglas B. (2008)
The Electronic Journal of Combinatorics [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:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity: