论文部分内容阅读
In 1966 T.Gallai asked whether connected graphs with empty intersection of their longest path do or do not exist.After examples of such graphs were found,the question was extended to graphs of higher connectivity,and to cycles instead of paths.