Intersection graphs of Helly families of subtrees
A Helly family of a graph \(H\) is a family of subtrees of \(H\) such that every subfamily of mutually intersecting subtrees has a nonempty intersection. The author shows that every graph is an intersection graph of a Helly family of subtrees of a graph without triangles.
scientific article; zbMATH DE number 897402
scientific article