Name
Abstract | ||
|---|---|---|
Kotzig (see Bondy and Murty, Graph Theory with Applications, North-Holland, Amsterdam, 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 . Kotzig (Graph Theory and Related Topics, Academic Press, New York, 1979, pp. 358–367) has proved this conjecture for 2<k<9 . Xing and Hu (Discrete Math. 135 (1994) 387–393) have proved it for k>11 . Here we prove this conjecture for the remaining cases k=9,10,11 . |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(99)00153-3 | Discrete Mathematics |
Keywords | Field | DocType |
unique regular path-connectivity,regular path-connectivity,eulerian graph,graph theory | Discrete mathematics,Complete graph,Combinatorics,Graph factorization,Cubic graph,Regular graph,Distance-regular graph,Factor-critical graph,Petersen graph,Mathematics,Pancyclic graph | Journal |
Volume | Issue | ISSN |
211 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.55 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuansheng Yang | 1 | 80 | 24.02 |
| Jianhua Lin | 2 | 8 | 2.87 |
| Chunli Wang | 3 | 2 | 2.24 |
| Kaifeng Li | 4 | 2 | 0.55 |