Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2018 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Block graph,Combinatorics,Clique,K-tree,Chordal graph,Clique-sum,Treewidth,Clique problem,Mathematics,Split graph |
DocType | Volume | Issue |
Journal | 25 | 2 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Hofer-Temmel | 1 | 0 | 0.34 |
| Florian Lehner | 2 | 21 | 7.24 |