Chorded Cycles

被引：3
|
作者：
Cream, Megan [1 ]
Faudree, Ralph J. [2 ]
Gould, Ronald J. [3 ]
Hirohata, Kazuhide [4 ]
机构：
[1] Spelman Coll, 350 Spelman Lane SW, Atlanta, GA 30314 USA
[2] Univ Memphis, Memphis, TN 38152 USA
[3] Emory Univ, 400 Dowman Dr, Atlanta, GA 30322 USA
[4] Ibaraki Coll, Natl Inst Technol, Ibaraki, Japan
来源：
GRAPHS AND COMBINATORICS | 2016年 / 32卷 / 06期
关键词：
Chorded cycles; Doubly chorded cycles; Degree-sum; Minimum degree; VERTEX; GRAPHS;
D O I：
10.1007/s00373-016-1729-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A chord is an edge between two vertices of a cycle that is not an edge on the cycle. If a cycle has at least one chord, then the cycle is called a chorded cycle, and if a cycle has at least two chords, then the cycle is called a doubly chorded cycle. The minimum degree and the minimum degree-sum conditions are given for a graph to contain vertex-disjoint chorded (doubly chorded) cycles containing specified elements of the graph, i.e., specified vertices, specified edges as cycle-edges, specified paths, or specified edges as chords. Furthermore, the minimum degree condition is given for a graph to be partitioned into chorded cycles containing specified edges as cycle-edges.
引用
收藏
页码：2295 / 2313
页数：19
相关论文
共 50 条
  • [1] Chorded Cycles
    Megan Cream
    Ralph J. Faudree
    Ronald J. Gould
    Kazuhide Hirohata
    [J]. Graphs and Combinatorics, 2016, 32 : 2295 - 2313
  • [2] MULTIPLY CHORDED CYCLES
    Gould, Ronald
    Horn, Paul
    Magnant, Colton
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 160 - 172
  • [3] Independent cycles and chorded cycles in graphs
    Gould, Ronald J.
    Hirohata, Kazuhide
    Horn, Paul
    [J]. JOURNAL OF COMBINATORICS, 2013, 4 (01) : 105 - 122
  • [4] On independent doubly chorded cycles
    Gould, Ronald J.
    Hirohata, Kazuhide
    Horn, Paul
    [J]. DISCRETE MATHEMATICS, 2015, 338 (11) : 2051 - 2071
  • [5] Disjoint chorded cycles in graphs
    Bialostocki, Arie
    Finkel, Daniel
    Gyarfas, Andras
    [J]. DISCRETE MATHEMATICS, 2008, 308 (23) : 5886 - 5890
  • [6] Results and Problems on Chorded Cycles: A Survey
    Gould, Ronald J.
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (06)
  • [7] Results and Problems on Chorded Cycles: A Survey
    Ronald J. Gould
    [J]. Graphs and Combinatorics, 2022, 38
  • [8] On the number of independent chorded cycles in a graph
    Finkel, Daniel
    [J]. DISCRETE MATHEMATICS, 2008, 308 (22) : 5265 - 5268
  • [9] DISJOINT CHORDED CYCLES OF THE SAME LENGTH
    Chen, Guantao
    Gould, Ronald J.
    Hirohata, Kazuhide
    Ota, Katsuhiro
    Shan, Songling
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (02) : 1030 - 1041
  • [10] Disjoint cycles and chorded cycles in a graph with given minimum degree
    Molla, Theodore
    Santana, Michael
    Yeager, Elyse
    [J]. DISCRETE MATHEMATICS, 2020, 343 (06)
12345