论文信息 - LONGEST CIRCUITS IN 3-CONNECTED GRAPHS

LONGEST CIRCUITS IN 3-CONNECTED GRAPHS

It is a well-known result of G.A. Dirac that a longest circuit in a 2-connected graph G contains all or at least 2 d min vertices of G where d min is the minimum valence of G. In this paper refinements of this result involving the connectivity of G are considered.

H. A. Jung

[1] G. A. Dirac,et al. Paths and circuits in graphs: Extreme cases , 1959 .

[2] Bill Jackson. Hamilton cycles in regular 2-connected graphs , 1980, J. Comb. Theory, Ser. B.

[3] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[4] Nathan Linial. A lower bound for the circumference of a graph , 1976, Discret. Math..

[5] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[6] László Babai. Long cycles in vertex-transitive graphs , 1979, J. Graph Theory.