Tree-decompositions, tree-representability and chordal graphs (Q1104938)

The following assertions are shown to be equivalent, for any countable graph G: (1) G can be represented as the intersection graph of a family of subtrees of a tree; (2) G admits a tree-decomposition (Robertson/Seymour) into primes; (3) G is chordal, and G admits a simplicial tree-decomposition (Halin) into primes; (4) G is chordal, and neither of two specified graphs is contained in G as a simplicial minor.