The Reconstruction of a Connected Graph from its Spanning Trees
Jiří Sedláček (1974)
Matematický časopis
Similarity:
Displaying similar documents to “Characterizing the maximum genus of a connected graph”
The Reconstruction of a Connected Graph from its Spanning Trees
A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
Yair Caro, Juan Rojas, Sergio Ruiz (1996)
Czechoslovak Mathematical Journal
Similarity:
On 2-cell embeddings of graphs with minimum numbers of regions
Ladislav Nebeský (1985)
Czechoslovak Mathematical Journal
Similarity: