Descents in noncrossing trees.
Hough, David S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Quantized dual graded graphs.”
Descents in noncrossing trees.
Counting two-graphs related to trees.
Cameron, Peter J. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Trees and matchings.
Kenyon, Richard W., Propp, James G., Wilson, David B. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of labelled -arch graphs.
Lamathe, Cédric (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
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:
Colored trees and noncommutative symmetric functions.
Szczesny, Matt (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Forest decompositions of graphs with cyclomatic number 2.
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Counting points of slope varieties over finite fields.
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A triple lacunary generating function for Hermite polynomials.
Gessel, Ira M., Jayawant, Pallayi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Deciding clique-width for graphs of bounded tree-width.
Espelage, Wolfgang, Gurski, Frank, Wanke, Egon (2003)
Journal of Graph Algorithms and Applications
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: