Intersection graphs of Helly families of subtrees (Q1917300): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)00136-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071616675 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intersection graphs of Helly families of subtrees |
scientific article |
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
