HAMILTONIAN CYCLE IN GRAPHS σ4 > = 2n

Nguyen Huu Xuan Truong, Vu Dinh Hoa

Abstract




Keywords


hamiltonian cycle; NPC; sigma4

Full Text:

PDF

References


Alan, G. Algorithmic Graph Theory. Cambridge University Press. Published June 27th 1985.

Bondy, J. A., and Chvátal, V. A Method in Graph Theory. Discrete Math. 15 (1976), pp 111-135.

Cuckler, B., and Kahn, J. Hamiltonian cycles in Dirac graphs. Combinatorica, 29, (2009), pp 299-326.

Diestel, R. Graph Theory. Springer. Third Edition (2005).

Ferrara, M., Jacobson, M. S., and Harris, A. Cycle lengths in a Hamiltonian Graphs with a pair of vertices having large degree sum. Graphs and Combinatorics, 26 (2010), pp 215-223.

Jung, H. A. On maximal circuits in finite graphs. Ann. Discrete Math., 3 (1978), pp. 129-144.

Hoa, V. D., and Truong, N. H. X. Hamilton cycle of graphs σ_2^*≥n. Journal Of Computer Science And Cybernetics., 28, No.2 (2012), pp 153-160.

Hoa, V. D., and Truong, N. H. X. Hamiltonian in graphs σ_3≥3/2 n-1. In Proceedings of the 7th National Conference on Fundamental and Applied Information Technology Research (FAIR’7) (Thai Nguyen, Vietnam, June 19-20, 2014). Vietnam Academy of Science and Technology Press, Hanoi, 2014, pp 60-67.

Krivelevich, M., Lee, C., and Sudakov, B. Long paths and cycle in random subgraphs of graphs with large minimum degree. Random Structure & Algorithm, volume 46, Issue 2, pp. 320–345, March 2015.

Nishiyama, H., Kobayashi, Y., Yamauchi, Y., Kijima, S., & Yamashita, M. (2015). The Parity Hamiltonian Cycle Problem. arXiv preprint arXiv:1501.06323.


Refbacks

  • There are currently no refbacks.


ISSN: 1694-2507 (Print)

ISSN: 1694-2108 (Online)