Author:
Meierling Dirk,Rautenbach Dieter
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Bauer, D., Schmeichel, E.F.: Hamiltonian degree conditions which imply a graph is pancyclic. J. Combin. Theory (B) 48, 111–116 (1990)
2. Bondy, J.A.: Pancyclic graphs. J. Combin. Theory (B) 11, 80–84 (1971)
3. Bondy, J.A.: Longest paths and cycles in graphs of high degree. Res. Rep. No. CORR 80–16, Univ. Waterloo, Waterloo, ON (1980)
4. Chvátal, V.: On Hamiltons ideals. J. Combin. Theory (B) 12, 163–168 (1972)
5. Fan, G.: New sufficient conditions for cycles in graphs. J. Combin. Theory (B) 37, 221–227 (1984)