Triangulated edge intersection graphs of paths in a tree (Q1061147): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:04, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangulated edge intersection graphs of paths in a tree |
scientific article |
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
