Large cycles in 4-connected graphs

DOI10.1016/J.DISC.2010.10.020MaRDI QIDQ626774zbMATH OpenOpenAlexFDO

Authors M. Zh. Nikoghosyan, Zh. G. 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

minimum degreeconnectivityHamilton cyclelongest cycledominating cycle

Mathematics Subject Classification ID

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

Abstract: Every 4-connected graph $G$ with minimum degree $delta$ and connectivity $kappa$ either contains a cycle of length at least $4delta-kappa-4$ or every longest cycle in $G$ is a dominating cycle.

Recommendations

• Longest cycles in 4-connected graphs
• Degree sums, connectivity and dominating cycles in graphs
• Degree sum conditions for the circumference of 4-connected graphs
• Degree sum and connectivity conditions for dominating cycles
• scientific article; zbMATH DE number 1076144

Cites work

• scientific article; zbMATH DE number 4162913 (Why is no real title available?)
• scientific article; zbMATH DE number 3570494 (Why is no real title available?)
• A degree sum condition with connectivity for relative length of longest paths and cycles
• Decomposition of Finite Graphs into Open Chains
• Degree sums, connectivity and dominating cycles in graphs
• Graph theory
• Two sufficient conditions for Hamilton and dominating cycles

Cited in

(8)

• scientific article; zbMATH DE number 3877231 (Why is no real title available?)
• Degree sum conditions for the circumference of 4-connected graphs
• Circumference of a graph and its distance dominating longest cycles
• Large cycles in generalized Johnson graphs
• Long cycles in 4-connected planar graphs
• Longest cycles in 4-connected graphs
• Degree sums, connectivity and dominating cycles in graphs
• Graph invariants and large cycles: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626774)