Large cycles in 4-connected graphs

DOI10.1016/j.disc.2010.10.020zbMath1222.05124arXiv0906.5053OpenAlexW2079362974MaRDI QIDQ626774

Zh. G. Nikoghosyan, M. Zh. Nikoghosyan

Publication date: 18 February 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.5053

zbMATH Keywords

connectivityminimum degreelongest cycleHamilton cycledominating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Degree sum conditions for the circumference of 4-connected graphs ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Graph invariants and large cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sum condition with connectivity for relative length of longest paths and cycles
• Two sufficient conditions for Hamilton and dominating cycles
• Decomposition of Finite Graphs into Open Chains
• Degree sums, connectivity and dominating cycles in graphs

This page was built for publication: Large cycles in 4-connected graphs