Paper Info
Title
Canonical tree-decompositions of a graph that display its k-blocks.
Abstract
A k-block in a graph G is a maximal set of at least k vertices no two of which can be separated in G by removing less than k vertices. It is separable if there exists a tree-decomposition of adhesion less than k of G in which this k-block appears as a part.
Year
DOI
Venue
2017
10.1016/j.jctb.2016.05.001
Journal of Combinatorial Theory, Series B
Keywords
DocType
Volume
Graph,Connectivity,Tree-decomposition,k-Block,Tangle,Profile
Journal
122
ISSN
Citations 
PageRank 
0095-8956
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Johannes Carmesin1297.08
J. Pascal Gollin200.68