Clique trees of infinite locally finite chordal graphs

Christoph Hofer-Temmel, Florian Lehner

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Article numberP2.9
JournalThe Electronic Journal of Combinatorics
Issue number2
Publication statusPublished - 2018
Externally publishedYes

Fields of Expertise

  • Information, Communication & Computing

Cite this