论文信息 - Bipartite graphs with every matching in a cycle

Bipartite graphs with every matching in a cycle

We give sufficient Ore-type conditions for a balanced bipartite graph to contain every matching in a hamiltonian cycle or a cycle not necessarily hamiltonian. Moreover, for the hamiltonian case we prove that the condition is almost best possible.

Denise Amar | A. Pawel Wojda | Evelyne Flandrin | Grzegorz Gancarzewicz

[1] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[2] Nicholas C. Wormald,et al. Cycles containing matchings and pairwise compatible euler tours , 1990, J. Graph Theory.

[3] Kenneth A. Berman,et al. Proof of a conjecture of Häggkvist on cycles and independent edges , 1983, Discret. Math..

[4] Zhenqi Yang,et al. On F-Hamiltonian graphs , 1999, Discret. Math..

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

[6] Α. P. Wojda. HAMILTONIAN CYCLES THROUGH MATCHINGS , 1988 .