Canonical tree-decompositions of finite graphs II. Essential parts-Reference-Cited by-同舟云学术

Canonical tree-decompositions of finite graphs II. Essential parts

Published:2016-05 Issue: Volume:118 Page:268-283
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Carmesin J.,Diestel R.,Hamann M.,Hundertmark F.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. Canonical tree-decompositions of finite graphs I. Existence and algorithms;Carmesin;J. Combin. Theory Ser. B,2015

2. k-Blocks: a connectivity invariant for graphs;Carmesin;SIAM J. Discrete Math.,2015

3. Connectivity and tree structure in finite graphs;Carmesin;Combinatorica,2014

4. Johannes Carmesin, Pascal Gollin, Canonical tree-decompositions isolating all their k-blocks, presentation at Hamburg Workshop on Graphs and Matroids, Spiekeroog 2014.

5. Graph Theory;Diestel,2010

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Entanglements;Journal of Combinatorial Theory, Series B;2024-01

2. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Structural submodularity and tangles in abstract separation systems;Journal of Combinatorial Theory, Series A;2019-10

4. A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors;SIAM Journal on Discrete Mathematics;2019-01

5. On the Block Number of Graphs;SIAM Journal on Discrete Mathematics;2019-01