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:
Displaying similar documents to “Spanning trees and function classes.”
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On cubes and dichotomic trees
Ladislav Nebeský (1974)
Časopis pro pěstování matematiky
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
On vertices and edges in maximum path-factors of a tree
Zdzisław Skupień, Władysław Zygmunt (1980)
Fundamenta Mathematicae
Similarity:
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A remark on signed posets and signed graphs
Bohdan Zelinka (1988)
Czechoslovak Mathematical Journal
Similarity:
Tree-thickness and caterpillar-thickness under girth constraints.
Liu, Qi, West, Douglas B. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: