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

DOI10.1016/0012-365X(93)E0106-EMaRDI QIDQ1343281zbMATH OpenOpenAlexWikidataFDO

Authors Keyi Xing, Baosheng Hu

Publication date 1 February 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)e0106-e

zbMATH Keywords

Kotzig's conjectureregular path-connectedness

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

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\).

Recommendations

• On Kotzig's conjecture concerning graphs with a unique regular path-connectivity
• Publication:4865527
• scientific article; zbMATH DE number 3914357
• Long path connectivity of regular graphs
• Connectivity of cages

Cites work

• Graph theory

Cited in

(8)

• Disproof of a conjecture on the existence of the path-recursive period for a connected graph
• On Kotzig's conjecture concerning graphs with a unique regular path-connectivity
• scientific article; zbMATH DE number 3849268 (Why is no real title available?)
• scientific article; zbMATH DE number 3914357 (Why is no real title available?)
• scientific article; zbMATH DE number 91036 (Why is no real title available?)
• On the Kőnig‐Egerváry theorem for ‐paths
• scientific article; zbMATH DE number 2192138 (Why is no real title available?)
• On the Forking Path Conjecture

This page was built for publication: On Kotzig's conjecture for graphs with a regular path-connectedness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343281)