论文信息 - The search for long paths and cycles in vertex-transitive graphs and digraphs - 字舞流文

The search for long paths and cycles in vertex-transitive graphs and digraphs

[1] László Babai,et al. On the Complexity of Canonical Labeling of Strongly Regular Graphs , 1980, SIAM J. Comput..

[2] Dragan Marui. On vertex symmetric digraphs , 1981 .

[3] Brian Alspach,et al. VERTEX‐TRANSITIVE GRAPHS OF ORDER 2p , 1979 .

[4] M. Watkins. Connectivity of transitive graphs , 1970 .

[5] C. C. Chen,et al. On strongly hamiltonian abelian group graphs , 1981 .

[6] Kozo Bannai. Hamiltonian cycles in generalized petersen graphs , 1978, J. Comb. Theory, Ser. B.

[7] James Turner. Point-symmetric graphs with a prime number of points , 1967 .

[8] H. Wielandt,et al. Finite Permutation Groups , 1964 .

[9] W. Mader. Eine Eigenschaft der Atome endlicher Graphen , 1971 .

[10] Paul Erdös,et al. When the cartesian product of directed cycles is Hamiltonian , 1978, J. Graph Theory.

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

[12] W. Holsztynski,et al. Paths and circuits in finite groups , 1978, Discret. Math..

[13] Joseph B. Klerlein. Hamiltonian cycles in cayley color graphs , 1978, J. Graph Theory.

[14] Dragan Marusic,et al. Hamiltonian paths in vertex-symmetric graphs of order 5p , 1982, Discret. Math..

[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .