SHANDONG SCIENCE ›› 2014, Vol. 27 ›› Issue (6): 105-107.doi: 10.3976/j.issn.1002-4026.2014.06.018

• Article • Previous Articles     Next Articles

Cycle extensibility of [4,1]-graphs

MOU Lei   

  1. Jinan Foreign Language School, Jinan 250107, China
  • Received:2014-06-01 Published:2014-12-20 Online:2014-12-20

Abstract: A graph G is a [s,t]-graph if at least t edges exist in its every included subgraph with s vertices. We prove that every connected and locally 2-connected [4,1]-graph is fully cycle extendable.

Key words: [s,t]-graph, cycle extendable, locally k-connected

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