Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Activities
Datasets
Equipment
Prizes
Press/Media
Search by expertise, name or affiliation
On tree-decompositions of one-ended graphs
Johannes Carmesin
, Florian Lehner
, Rögnvaldur G. Möller
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
120
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On tree-decompositions of one-ended graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Tree Decomposition
100%
Automorphism Group
66%
Disjoint
66%
Infinite Family
66%
Finite number
33%
One-component
33%
Number of Vertices
33%
Decomposition Tree
33%
Infinite Path
33%
Then What
33%
Mathematics
Pairwise Disjoint
100%
Dominates
50%
Automorphism
50%
Finite Number
50%
Automorphism Group
50%