Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Bondy, J.A. and Locke, S.C.: Relative lengths of paths and cycles in 3-connected graphs. Discrete Math. 33 (1981), 111–122.
2. Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. soc. 3 (1952)2, 69–81.
3. Erdös, P. and Gallai, T.: On maximal paths and circuits in graphs. Acta Math. Acad. Sci. Hung. 10 (1959), 337–356.
4. Fraisse, P. and Jung, H. A.: Longest cycles and independent sets in k-connected graphs. In: Recent Studies in Graph Theory (edited by V.R. Kulli), Vishna Internat. Publ. Gulbarga, India, 1989, p. 114–139.
5. Jung, H.A.: Long cycles in graphs with moderate connectivity. In: Topics in Combinatorics and Graph Theory, Essays in Honour of Gerhard Ringel (edited by R. Bodendiek and R. Henn), Physica-Verlag, Heidelberg, 1990, p. 765–778.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献