Projects per year
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.
| Original language | English |
|---|---|
| Article number | P2.9 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 25 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2018 |
| Externally published | Yes |
Fields of Expertise
- Information, Communication & Computing
Fingerprint
Dive into the research topics of 'Clique trees of infinite locally finite chordal graphs'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Doctoral Program: Discrete Mathematics
Ebner, O., Lehner, F., Greinecker, F., Burkard, R., Wallner, J., Elsholtz, C., Woess, W., Raseta, M., Bazarova, A., Krenn, D., Lehner, F., Kang, M., Tichy, R., Sava-Huss, E., Klinz, B., Heuberger, C., Grabner, P., Barroero, F., Cuno, J., Kreso, D., Berkes, I. & Kerber, M.
1/05/10 → 30/06/24
Project: Research project