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

Christian Elbracht; Jan Kurkofka; Maximilian Teegen

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

Christian Elbracht, Jan Kurkofka, Maximilian Teegen

Mathematics

Research output: Working paper/Preprint › Preprint

26 Downloads (Pure)

Abstract

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.

Original language	English
Publication status	Published - 14 Dec 2020

Bibliographical note

12 pages, 2 figures

Keywords

math.CO
cs.DM
05C40 (Primary), 05C05, 05C69, 05C70, 05C83, 05C63 (Secondary)

Access to Document

2012.07651v2

Cite this

@techreport{a83b6e4838c84897ac7f97c59f17dfa7,

title = "Edge-connectivity and tree-structure in finite and infinite graphs",

abstract = " 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. ",

keywords = "math.CO, cs.DM, 05C40 (Primary), 05C05, 05C69, 05C70, 05C83, 05C63 (Secondary)",

author = "Christian Elbracht and Jan Kurkofka and Maximilian Teegen",

note = "12 pages, 2 figures",

year = "2020",

month = dec,

day = "14",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

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

AU - Elbracht, Christian

AU - Kurkofka, Jan

AU - Teegen, Maximilian

N1 - 12 pages, 2 figures

PY - 2020/12/14

Y1 - 2020/12/14

N2 - 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.

AB - 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.

KW - math.CO

KW - cs.DM

KW - 05C40 (Primary), 05C05, 05C69, 05C70, 05C83, 05C63 (Secondary)

M3 - Preprint

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

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this