Clique trees of infinite locally finite chordal graphs

Christoph Hofer-Temmel; Florian Lehner

doi:10.37236/3928

Clique trees of infinite locally finite chordal graphs

Christoph Hofer-Temmel, Florian Lehner

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

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.

Originalsprache	englisch
Aufsatznummer	P2.9
Fachzeitschrift	The Electronic Journal of Combinatorics
Jahrgang	25
Ausgabenummer	2
DOIs	https://doi.org/10.37236/3928
Publikationsstatus	Veröffentlicht - 2018
Extern publiziert	Ja

Fields of Expertise

Information, Communication & Computing

Zugriff auf Dokument

10.37236/3928

DK Diskrete Mathematik
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
Projekt: Forschungsprojekt

Dieses zitieren

@article{82b0f6558147430ab6caf11bf570f5b7,

title = "Clique trees of infinite locally finite chordal graphs",

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. ",

author = "Christoph Hofer-Temmel and Florian Lehner",

year = "2018",

doi = "10.37236/3928",

language = "English",

volume = "25",

journal = "The Electronic Journal of Combinatorics ",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Clique trees of infinite locally finite chordal graphs

AU - Hofer-Temmel, Christoph

AU - Lehner, Florian

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

U2 - 10.37236/3928

DO - 10.37236/3928

M3 - Article

SN - 1077-8926

VL - 25

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

IS - 2

M1 - P2.9

ER -

Clique trees of infinite locally finite chordal graphs

Abstract

Fields of Expertise

Zugriff auf Dokument

Fingerprint

Projekte

DK Diskrete Mathematik

Dieses zitieren