WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? (Q3634208): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Maria A. Axenovich / rank | |||
| Property / author | |||
| Property / author: Maria A. Axenovich / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Longest Paths in Circular Arc Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stable set meeting every longest path / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Smallest Sets of Longest Paths with Empty Intersection / rank | |||
Normal rank | |||
Latest revision as of 16:25, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? |
scientific article |
Statements
WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? (English)
0 references
23 June 2009
0 references
longest paths
0 references
intersection
0 references
