Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions (Q2641317)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4189775
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions |
scientific article; zbMATH DE number 4189775 |
Statements
Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions (English)
0 references
1990
0 references
[For part I, cf. the preceding review.] A simplicial tree-decomposition of a graph is a covering family of induced subgraphs (factors), indexed by some ordinal, which overlap only by simplices (complete subgraphs). A graph is called prime if it does not allow a (simplicial) tree-decomposition. In this second of a series of three papers on the subject a characterization is obtained of those countable graphs admitting a simplicial tree-decomposition into primes, i.e. such that each factor is prime.
0 references
infinite graphs
0 references
simplicial tree-decomposition
0 references
0 references
0.955963969230652
0 references
0.9447881579399108
0 references
0.8921539187431335
0 references
