Simplicial Decomposition


Networks ◽  
1995 ◽  
Vol 26 (4) ◽  
pp. 199-215 ◽  
Author(s):  
ÁNgel Marín


2019 ◽  
Vol 75 (2) ◽  
pp. 321-360
Author(s):  
Enrico Bettiol ◽  
Lucas Létocart ◽  
Francesco Rinaldi ◽  
Emiliano Traversi


2006 ◽  
pp. 2375-2378
Author(s):  
Siriphong Lawphongpanich


1993 ◽  
Vol 59 (1-3) ◽  
pp. 71-85 ◽  
Author(s):  
Jose A. Ventura ◽  
Donald W. Hearn




1970 ◽  
Vol 26 ◽  
pp. 62 ◽  
Author(s):  
Erik M. Alfsen ◽  
Christian F. Skau




1988 ◽  
Vol 103 (3) ◽  
pp. 409-426 ◽  
Author(s):  
Reinhard Diestel

The purpose of this paper is to give natural characterizations of the countable graphs that admit tree-decompositions or simplicial tree-decompositions into primes. Tree-decompositions were recently introduced by Robertson and Seymour in their series of papers on graph minors [7]. Simplicial tree-decompositions were first considered by Halin[6], being the most typical kind of ‘simplicial decomposition’ as introduced by Halin[5] in 1964. The problem of determining which infinite graphs admit a simplicial decomposition into primes has stood unresolved since then; a first solution for simplicial tree-decompositions was given in [2].



Sign in / Sign up

Export Citation Format

Share Document