论文信息 - Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments - 字舞流文

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments

We characterize those bipartite tournaments which have a hamiltonian path with given unordered endvertices. Our proof gives rise to a polynomial algorithm to decide the existence of such a path and find one, if it exists.

Yannis Manoussakis | Jørgen Bang-Jensen | Y. Manoussakis | J. Bang-Jensen

[1] Bill Jackson,et al. Long paths and cycles in oriented graphs , 1981, J. Graph Theory.

[2] Zsolt Tuza,et al. Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments , 1990, SIAM J. Discret. Math..

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

[4] Yannis Manoussakis. Problèmes extrémaux dans les graphes orientés , 1987 .

[5] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .

[6] R. Häggkvist,et al. Cycles and paths in bipartite tournaments with spanning configurations , 1989, Comb..

[7] Carsten Thomassen,et al. Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.