Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (Q895993): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1538190426 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1305.4668 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Canonical tree-decompositions of finite graphs. II. Essential parts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: $k$-Blocks: A Connectivity Invariant for Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity and tree structure in finite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3577833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex Cuts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216652 / rank | |||
Normal rank |
Latest revision as of 04:28, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Canonical tree-decompositions of finite graphs. I: Existence and algorithms. |
scientific article |
Statements
Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (English)
0 references
11 December 2015
0 references
connectivity
0 references
tree-decomposition
0 references
\(k\)-block
0 references
tangle
0 references
profile
0 references
Tutte decomposition
0 references