Triangulated edge intersection graphs of paths in a tree (Q1061147)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Triangulated edge intersection graphs of paths in a tree |
scientific article; zbMATH DE number 3908481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangulated edge intersection graphs of paths in a tree |
scientific article; zbMATH DE number 3908481 |
Statements
Triangulated edge intersection graphs of paths in a tree (English)
0 references
1985
0 references
An EPT (VPT) graph is an intersection graph of paths in a tree, where two paths intersect if they share an edge (a vertex, resp.). In this note, author's conjecture that every triangulated EPT graph is VPT graph is solved in the affirmative.
0 references
EPT
0 references
VPT
0 references
intersection graph of paths
0 references
