Intersection graphs of Helly families of subtrees (Q1917300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 897402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intersection graphs of Helly families of subtrees |
scientific article; zbMATH DE number 897402 |
Statements
Intersection graphs of Helly families of subtrees (English)
0 references
7 July 1996
0 references
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.
0 references
Helly family
0 references
subtrees
0 references
intersection graph
0 references
0 references
0.7837603688240051
0 references
0.7813838124275208
0 references
