Tree representations of graphs
Document Type
Article
Date of Original Version
5-1-2007
Abstract
A graph is chordal if and only if it is the intersection graph of some family of subtrees of a tree. Applying "tolerance" allows larger families of graphs to be represented by subtrees. A graph G is in the family [Δ, d, t] if there is a tree with maximum degree Δ and subtrees corresponding to the vertices of G such that each subtree has maximum degree at most d and two vertices of G are adjacent if and only if the subtrees corresponding to them have at least t common vertices. It is known that both [3, 3, 1] and [3, 3, 2] are equal to the family of chordal graphs. Furthermore, one can easily observe that every graph G belongs to [3, 3, t] for some t. Denote by t (G) the minimum t so that G ∈ [3, 3, t]. In this paper, we study t (G) and parameters t (n) = min {t : G ∈ [3, 3, t] for every G ⊆ Kn} and tbip (n) = min {t : G ∈ [3, 3, t] for every G ⊆ Kn, n} . In particular, our results imply that log n < tbip (n) ≤ 5 n1 / 3 log2 n and log (n / 2) < t (n) ≤ 20 n1 / 3 log2 n. © 2006 Elsevier Ltd. All rights reserved.
Publication Title, e.g., Journal
European Journal of Combinatorics
Volume
28
Issue
4
Citation/Publisher Attribution
Eaton, Nancy, Zoltán Füredi, Alexandr V. Kostochka, and Jozef Skokan. "Tree representations of graphs." European Journal of Combinatorics 28, 4 (2007): 1087-1098. doi: 10.1016/j.ejc.2006.04.002.