Author:
Diestel Reinhard,Hundertmark Fabian,Lemanczyk Sahar
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-Blocks: a connectivity invariant for graphs, SIAM J. Discrete Math.
28 (2014), 1876–1891.
2. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs I. Existence and algorithms, J. Combin. Theory Ser. B
116 (2016), 1–24.
3. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs II. Essential parts, J. Combin. Theory Ser. B
118 (2016), 268–283.
4. J. Carmesin, R. Diestel, F. Hundertmark and M. Stein: Connectivity and tree structure in finite graphs, Combinatorica
34 (2014), 1–35.
5. R. Diestel: Graph Theory (5th edition, 2016), Springer-Verlag, 2017. Electronic edition available at
http://diestel-graph-theory.com/.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficiently distinguishing all tangles in locally finite graphs;Journal of Combinatorial Theory, Series B;2024-07
2. Tangles and Hierarchical Clustering;SIAM Journal on Discrete Mathematics;2024-01-05
3. Entanglements;Journal of Combinatorial Theory, Series B;2024-01
4. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Canonical trees of tree-decompositions;Journal of Combinatorial Theory, Series B;2022-01