Clique trees of infinite locally finite chordal graphs
Electronic Journal of Combinatorics , Volume 25 - Issue 2 p. P2.9
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees. This allows us to enumerate the clique trees of a chordal graph and extend various classic characterisations of clique trees to the infinite setting.
|Electronic Journal of Combinatorics|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Hofer-Temmel, C, & Lehner, F. (2018). Clique trees of infinite locally finite chordal graphs. Electronic Journal of Combinatorics, 25(2). doi:10.37236/3928