J4 ›› 2011, Vol. 24 ›› Issue (1): 68-71.

• Content • Previous Articles     Next Articles

Hamilton cycles of 2-connected [4,1]-graphs

 ZHANG Wei, WANG Jiang-Lu   

  1. School of Mathematics, Shandong Normal University, Jinan 250014, China
  • Published:2011-02-20 Online:2011-02-20

Abstract:

       A graph G is a [s,t]- graph if there are at least t edges in every included subgraph of s vertices. This paper proves that the sufficient and necessary condition of a 2-connected [4,1]- graph to be a Hamilton cycle is that it is not isomorphic to three kinds of specific graphs.

Key words: [s,t]- graph, Hamilton cycle, connectivity

CLC Number: 

  • O157.5

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0