Abstract
It is shown that, for every integer v < 7, there is a connected graph in which some v longest paths have empty intersection, but any v – 1 longest paths have a vertex in common. Moreover, connected graphs having seven or five minimal sets of longest paths (longest cycles) with empty intersection are presented. A 26-vertex 2-connected graph whose longest paths have empty intersection is exhibited.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference7 articles.
1. Theory of Graphs
2. Exact numbers of longest cycles with empty intersection;Jendrol;Euro. J. Combin.,1996
3. Homogeneously traceable and Hamiltonian connected graphs;Skupień;Demonstratio Math.,1984
4. On longest paths and circuits in graphs.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献