Triangulated edge intersection graphs of paths in a tree (Q1061147): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The edge intersection graphs of paths in a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge and vertex intersection of paths in a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Intersection representations of graphs by arcs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4200254 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On cycle bases of a graph / rank | |||
Normal rank | |||
Latest revision as of 17:17, 14 June 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
