A Note on Cycle Lengths in Graphs

被引：0

作者：

R.J. Gould

P.E. Haxell

A.D. Scott

机构：

[1] Department of Mathematics and Computer Science,

[2] Emory University,undefined

[3] Atlanta,undefined

[4] GA 30322,undefined

[5] USA. e-mail: rg@mathcs.emory.edu,undefined

[6] Department of Combinatorics and Optimization,undefined

[7] University of Waterloo,undefined

[8] Waterloo,undefined

[9] Ont.,undefined

[10] N2L 3G1,undefined

[11] Canada. e-mail: pehaxell@math.uwaterloo.ca,undefined

[12] Department of Mathematics,undefined

[13] University College,undefined

[14] London,undefined

[15] WC1E 6BT,undefined

[16] UK. e-mail: scott@math.ucl.ac.uk,undefined

来源：

Graphs and Combinatorics | 2002年 / 18卷

关键词：

Key words. Cycle lengths, Minimum degree, Circumference;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We prove that for every c>0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even t in the interval [4,ec(G) − K] and every odd t in the interval [K,oc(G) − K], where ec(G) and oc(G) denote the length of the longest even cycle in G and the longest odd cycle in G respectively. We also give a rough estimate of the magnitude of K.

引用

页码：491 / 498

页数：7

共 50 条

[41] Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs
Chizmar, Emily
Magnant, Colton
Nowbandegani, Pouria Salehi
GRAPHS AND COMBINATORICS, 2016, 32 (03) : 881 - 886
[42] GRAPHS WITH ODD CYCLE LENGTHS 5 AND 7 ARE 3-COLORABLE
Kaiser, Tomas
Rucky, Ondrej
Skrekovski, Riste
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (03) : 1069 - 1088
[43] Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
Michael Ferrara
Michael S. Jacobson
Angela Harris
Graphs and Combinatorics, 2010, 26 : 215 - 223
[44] Cycle Lengths in Hamiltonian Graphs with a Pair of Vertices Having Large Degree Sum
Ferrara, Michael
Jacobson, Michael S.
Harris, Angela
GRAPHS AND COMBINATORICS, 2010, 26 (02) : 215 - 223
[45] Retraction Note to: A study on domatic number of cycle related graphs
A. Antony Mary
A. Amutha
Journal of Ambient Intelligence and Humanized Computing, 2023, 14 (Suppl 1) : 515 - 515
[46] Note on cycle-(super)magic labelings of disconnected graphs
Khalid, Madiha
Rizvi, Syed Tahir Raza
Ali, Kashif
UTILITAS MATHEMATICA, 2017, 104 : 315 - 320
[47] 2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths
Cada, Roman
Chiba, Shuya
Yoshimoto, Kiyoshi
GRAPHS AND COMBINATORICS, 2015, 31 (01) : 99 - 113
[48] 2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths
Roman Čada
Shuya Chiba
Kiyoshi Yoshimoto
Graphs and Combinatorics, 2015, 31 : 99 - 113
[49] Lengths of edges in carrier graphs
Siler, Michael
GEOMETRIAE DEDICATA, 2012, 161 (01) : 1 - 10
[50] Linkwed graphs with restricted lengths
Chen, Guantao
Chen, Yuan
Gao, Shuhong
Hu, Zhiquan
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (04) : 735 - 751

← 1 2 3 4 5 →