Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. N. Alon, Tough Ramsey graphs without short cycles, Manuscript (1993).
2. D. Amar, A condition for a hamiltonian graph to be bipancyclic, Discr. Math.
102(1991), 221–227.
3. D. Amar, I. Fournier and A. Germa, Pancyclism in Chvátal—Erdős graphs, Graphs and Combinatorics
7 (1991), 101–112.
4. D. Amar and Y. Manoussakis, Cycles and paths of many lengths in bipartite digraphs, J. Combin. Theory Ser. B
50 (1990), 254–264.
5. D. Bauer, J. van
den Heuvel and E. Schmeichel, Toughness and triangle-free graphs, Preprint (1993).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献