Connectivity and tree structure in finite graphs-Reference-Cited by-同舟云学术

Connectivity and tree structure in finite graphs

Published:2014-01-30 Issue:1 Volume:34 Page:11-46
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Carmesin Johannes,Diestel Reinhard,Hundertmark Fabian,Stein Maya

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-014-2898-5.pdf

Reference12 articles.

1. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs I. Existence and algorithms, arXiv:1305.4668, 2013.

2. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: Canonical tree-decompositions of finite graphs II. The parts, arXiv:1305.4909, 2013.

3. J. Carmesin, R. Diestel, M. Hamann and F. Hundertmark: k-Blocks: a connectivity invariant for graphs, arXiv:1305.4557, 2009

4. R. Diestel: Graph Theory, Springer, 4th edition, 2010.

5. R. Diestel, K. Yu. Gorbunov, T. Jensen and C. Thomassen: Highly connected sets and the excluded grid theorem, J. Combin. Theory (Series B), 75 (1999), 61–73.

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

1. Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure;Journal of Combinatorial Theory, Series B;2024-07

2. Efficiently distinguishing all tangles in locally finite graphs;Journal of Combinatorial Theory, Series B;2024-07

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. Packing cycles in undirected group-labelled graphs;Journal of Combinatorial Theory, Series B;2023-07