Clique trees of infinite locally finite chordal graphs

zbMath1391.05186arXiv1311.7001MaRDI QIDQ1753106

Christoph Hofer-Temmel, Florian Lehner

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.7001

zbMATH Keywords

graph theorychordal graphsinfinite graphsclique trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• On the representation of triangulation graphs in trees
• Counting clique trees and computing perfect elimination schemes in parallel
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On the Desirability of Acyclic Database Schemes
• Power of Natural Semijoins

This page was built for publication: Clique trees of infinite locally finite chordal graphs