Edge-connectivity and tree-structure in finite and infinite graphs
Combinatorics
2021-05-03 v2 Discrete Mathematics
Abstract
We show that every graph admits a canonical tree-like decomposition into its -edge-connected pieces for all simultaneously.
Cite
@article{arxiv.2012.07651,
title = {Edge-connectivity and tree-structure in finite and infinite graphs},
author = {Christian Elbracht and Jan Kurkofka and Maximilian Teegen},
journal= {arXiv preprint arXiv:2012.07651},
year = {2021}
}
Comments
12 pages, 2 figures