Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Press/Media
Datasets
Activities
Fellowships, Honors, and Prizes
Search by expertise, name or affiliation
Bi-cyclic decompositions of complete graphs into spanning trees
Dalibor Froncek
Mathematics & Statistics
Research output
:
Contribution to journal
›
Article
›
peer-review
14
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bi-cyclic decompositions of complete graphs into spanning trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Spanning tree
100%
Complete Graph
90%
Isomorphic
70%
Vertex Labeling
67%
Decompose
63%
3D
52%
Labeling
47%
Factorization
40%