On Kotzig's conjecture for graphs with a regular path-connectedness

AbstractKotzig (see Bondy and 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. Here we prove this conjecture for k ⩾ 12