A proof of the two-path conjecture (Q5960794): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 00:50, 5 March 2024
scientific article; zbMATH DE number 1730014
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of the two-path conjecture |
scientific article; zbMATH DE number 1730014 |
Statements
A proof of the two-path conjecture (English)
0 references
25 April 2002
0 references
The authors prove the following result: If a graph \(G\) decomposes into two paths \(X\) and \(Y\), each of length \(n\) with \(n\geq 2\), and \(X\) and \(Y\) have at least one common vertex, then \(G\) has a path of length \(n\) distinct from \(X\) and \(Y\).
0 references
connected graph
0 references
path
0 references
