Intersection graphs of Helly families of subtrees
نویسندگان
چکیده
منابع مشابه
Helly Property for Subtrees
One can prove the following proposition (1) For every non empty finite sequence p holds 〈p(1)〉 aa p = p. Let p, q be finite sequences. The functor maxPrefix(p, q) yielding a finite sequence is defined by: (Def. 1) maxPrefix(p, q) p and maxPrefix(p, q) q and for every finite sequence r such that r p and r q holds r maxPrefix(p, q). Let us notice that the functor maxPrefix(p, q) is commutative. W...
متن کاملConstant tolerance intersection graphs of subtrees of a tree
A chordal graph is the intersection graph of a family of subtrees of a host tree. In this paper we generalize this. A graph G = (V ,E) has an (h, s, t)-representation if there exists a host tree T of maximum degree at most h, and a family of subtrees {Sv}v∈V of T, all of maximum degree at most s, such that uv ∈ E if and only if |Su∩Sv | t . For given h, s, and t, there exist infinitely many for...
متن کاملIntersection representations of matrices by subtrees and unicycles on graphs
Consider a 0-1 matrix M(i,j) with columns C={c1, c2,..., cm}, and rows R, or – equivalently – a hypergraph M(R,C) having M as its adjacency matrix (where R are the vertices and C are the hyperedges). Denote ri={cj| cj∈C and M(i,j)=1}. We consider the following two problems: (a) Is there a graph H, with vertex set C, such that every vertex subgraph H(ri) of H is a tree and the intersection of ev...
متن کاملThe Speeds of Families of Intersection Graphs
A fundamental question of graph theory lies in counting the number of graphs which satisfy certain properties. In particular, the structure of intersection graphs of planar curves is unknown, and Schaefer, Sedgwick, and Štefankovič have shown that recognizing such graphs is NP-complete. As such, the number of intersection graphs of planar curves poses an interesting problem. Pach and Tóth have ...
متن کاملFinding intersection models: From chordal to Helly circular-arc graphs
Every chordal graph G admits a representation as the intersection graph of a family of subtrees of a tree. A classic way of finding such an intersection model is to look for a maximum spanning tree of the valuated clique graph of G. Similar techniques have been applied to find intersection models of chordal graph subclasses as interval graphs and path graphs. In this work, we extend those metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00136-2