Long Cycles through Specified Vertices in a Graph(Group and Algebraic Combinatorial Theory)
Akira Saito · Institutional Repositories DataBase (IRDB) · 1987
In this paper, we consider the length of the longest cycle through specified vertices.We show the following two results.(1) Let $G$ be a k-connected graph of order at least $2k$ and circumference $l$ .Suppose $m