Paper Info
Title
A short proof that every finite graph has a tree-decomposition displaying its tangles.
Abstract
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles.This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to matroids is due to Geelen, Gerards and Whittle.
Year
DOI
Venue
2016
10.1016/j.ejc.2016.04.007
Eur. J. Comb.
Field
DocType
Volume
Matroid,Discrete mathematics,Combinatorics,Robertson–Seymour theorem,Forbidden graph characterization,Graphic matroid,Graph minor,Pathwidth,Mathematics,Planar graph,Branch-decomposition
Journal
58
Issue
ISSN
Citations 
C
0195-6698
0
PageRank 
References 
Authors
0.34
4
1
Name
Order
Citations
PageRank
Johannes Carmesin1297.08