
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.
infinite graphs, 05C62, 05C05 05C30, graph theory, Graph representations (geometric and intersection representations, etc.), Enumeration in graph theory, chordal graphs, Trees, FOS: Mathematics, clique trees, Mathematics - Combinatorics, Combinatorics (math.CO)
infinite graphs, 05C62, 05C05 05C30, graph theory, Graph representations (geometric and intersection representations, etc.), Enumeration in graph theory, chordal graphs, Trees, FOS: Mathematics, clique trees, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
