English

On the circumference, connectivity and dominating cycles

Combinatorics 2009-06-11 v1
Authors: Zh. G. Nikoghosyan
View on arXiv ↗ PDF ↗

Abstract

Every 4-connected graph with minimum degree δ\delta and connectivity κ\kappa either has a cycle of length at least 4δ−2κ4\delta-2\kappa or has a dominating cycle.

Keywords

graph cycles graph connectivity graph theory

Cite

@article{arxiv.0906.1857,
  title  = {On the circumference, connectivity and dominating cycles},
  author = {Zh. G. Nikoghosyan},
  journal= {arXiv preprint arXiv:0906.1857},
  year   = {2009}
}

Comments

31 pages

Related papers

View all related →
Combinatorics · Mathematics
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
2009-06-30
Combinatorics · Mathematics
Degree Conditions for Dominating Cycles in 1-tough Graphs
Zh. G. Nikoghosyan
2012-02-14
Combinatorics · Mathematics
A Lower Bound for the Circumference Involving Connectivity
Zh. G. Nikoghosyan
2009-07-16
Combinatorics · Mathematics
Dominating cycles and forbidden pairs containing a path of order 5
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
2015-02-11
Combinatorics · Mathematics
A Degree Condition for Dominating Cycles in $t$-tough Graphs with $t>1$
Zh. G. Nikoghosyan
2012-01-10
Combinatorics · Mathematics
A Size Upper Bound for Dominating Cycles
Zh. G. Nikoghosyan
2011-12-13
Combinatorics · Mathematics
Circumference of essentially 4-connected planar triangulations
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2021-01-28
Combinatorics · Mathematics
The circumference of a graph with given minimum degree and clique number
Na Chen, Yurui Tang
2025-10-31
Combinatorics · Mathematics
Graphs with no $2\delta + 1$ cycle
Galen E. Turner
2007-05-23
Combinatorics · Mathematics
On the Circumference of Essentially 4-connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2019-12-09
Combinatorics · Mathematics
Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
Avery Carr
2026-02-02
Combinatorics · Mathematics
A Common Generalization of Dirac's two Theorems
Zh. G. Nikoghosyan
2014-07-21
Combinatorics · Mathematics
Existence of cycles of length divisible by 3 or 4
Ilkyoo Choi, Hojin Chu, Ringi Kim, Boram Park
2026-05-05
Combinatorics · Mathematics
Long cycles in graphs through fragments
Zh. G. Nikoghosyan
2008-09-05
Combinatorics · Mathematics
On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$
Zh. G. Nikoghosyan
2009-05-12
Combinatorics · Mathematics
Pancyclicity of highly connected graphs
Shoham Letzter
2023-09-25
Combinatorics · Mathematics
Forbidden pairs and the existence of a dominating cycle
Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya
2015-02-10
Combinatorics · Mathematics
A Sharp Bound for the Circumference in $t$-tough graphs with $t>1$
Zh. G. Nikoghosyan
2012-05-01
Combinatorics · Mathematics
On two cycles of consecutive even lengths
Jun Gao, Binlong Li, Jie Ma, Tianying Xie
2022-10-11
Combinatorics · Mathematics
2-Coupon Coloring of Cubic Graphs Containing 3-Cycle or 4-Cycle
S. Akbari, M. Azimian, A. Fazli Khani, B. Samimi +1
2023-08-30
Combinatorics · Mathematics
Sufficient conditions for graphs to be $k$-connected, maximally connected and super-connected
Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen, Lutz Volkmann
2017-08-21
Combinatorics · Mathematics
Short cycle covers of cubic graphs and intersecting 5-circuits
Robert Lukoťka
2019-01-31
Combinatorics · Mathematics
Large cycles in essentially 4-connected graphs
Michael Wigal, Xingxing Yu
2020-03-24
Combinatorics · Mathematics
A note on directed 4-cycles in digraphs
Hao Liang, Jun-Ming Xu
2012-04-23
Combinatorics · Mathematics
Independence and Connectivity of Connected Domination Critical Graphs
Pawaton Kaemawichanurat, Louis Caccetta
2019-11-13
R2 v1 2026-06-21T13:11:43.577Z