arXiv Analytics

Sign in

arXiv:2012.07651 [math.CO]AbstractReferencesReviewsResources

Edge-connectivity and tree-structure in finite and infinite graphs

Christian Elbracht, Jan Kurkofka, Maximilian Teegen

Published 2020-12-14, updated 2021-04-30Version 2

We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.

Comments: 12 pages, 2 figures
Categories: math.CO, cs.DM
Subjects: 05C40, 05C05, 05C69, 05C70, 05C83, 05C63
Related articles: Most relevant | Search more
arXiv:2405.06756 [math.CO] (Published 2024-05-10)
Tangle-tree duality in infinite graphs
arXiv:2106.09468 [math.CO] (Published 2021-06-17)
Vertex-regular $1$-factorizations in infinite graphs
arXiv:2405.06755 [math.CO] (Published 2024-05-10)
Counterexamples regarding linked and lean tree-decompositions of infinite graphs

Links

Toolbox