On Kotzig's conjecture for graphs with a regular path-connectedness (Q1343281)
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: On Kotzig's conjecture for graphs with a regular path-connectedness |
scientific article; zbMATH DE number 716474
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Kotzig's conjecture for graphs with a regular path-connectedness |
scientific article; zbMATH DE number 716474 |
Statements
On Kotzig's conjecture for graphs with a regular path-connectedness (English)
0 references
1 February 1995
0 references
Anton Kotzig (see the book by J. A. Bondy and U. S. R. Murty (1976)) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length \(k\), \(k>2\). In this paper the authors prove the conjecture for \(k\geq 12\).
0 references
Kotzig's conjecture
0 references
regular path-connectedness
0 references
