Forbidden subgraphs for chorded pancyclicity

被引：3

作者：

Cream, Megan ^{[1
]}

Gould, Ronald J. ^{[2
]}

Larsen, Victor ^{[3
]}

机构：

[1] Spelman Coll, Dept Math, 350 Spelman Lane SW, Atlanta, GA 30314 USA

[2] Emory Univ, Dept Math & Comp Sci, 400 Dowman Dr, Atlanta, GA 30322 USA

[3] Kennesaw State Univ, Dept Math, 1100 S Marietta Pkwy, Marietta, GA 30060 USA

来源：

DISCRETE MATHEMATICS | 2017年 / 340卷 / 12期

关键词：

Pancyclic; Chorded cycle; Forbidden subgraph; Hamiltonian; HAMILTONIAN PROPERTIES;

D O I：

10.1016/j.disc.2017.07.027

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We call a graph G pancyclic if it contains at least one cycle of every possible length m, for 3 <= m <= vertical bar V(G)vertical bar. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length 4, 5, ... , vertical bar V(G)vertical bar. In particular, certain paths and triangles with pendant paths are forbidden. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：2878 / 2888

页数：11

共 5 条

[1] Faudree R.J., 1995, J. Combin. Math. Combin. Comput, V19, P109
[2] Characterizing forbidden pairs for Hamiltonian properties
Faudree, RJ
Gould, RJ
[J]. DISCRETE MATHEMATICS, 1997, 173 (1-3) : 45 - 60
[3] Goodman S., 1974, Journal of Combinatorial Theory, Series B, V16, P175, DOI 10.1016/0095-8956(74)90061-6
[4] Gould R., 2012, Graph Theory
[5] FORBIDDEN SUBGRAPHS AND HAMILTONIAN PROPERTIES OF GRAPHS
GOULD, RJ
JACOBSON, MS
[J]. DISCRETE MATHEMATICS, 1982, 42 (2-3) : 189 - 196

← 1 →