Characterizing the maximum genus of a connected graph
Ladislav Nebeský (1993)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Spanning subgraphs of embedded graphs”
Characterizing the maximum genus of a connected graph
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Simple 3-polytopal graphs with edges of only two types and shortness coefficients
Michal Tkáč (1992)
Mathematica Slovaca
Similarity:
The Reconstruction of a Connected Graph from its Spanning Trees
Jiří Sedláček (1974)
Matematický časopis
Similarity:
On some problem related to fundamental cycle sets of a graph: Research notes
Maciej Sysło (1982)
Banach Center Publications
Similarity: