Degree sum conditions for the circumference of 4-connected graphs

DOI10.1016/j.disc.2014.06.012zbMath1298.05182OpenAlexW1989719007MaRDI QIDQ400404

Shuya Chiba, Masao Tsugaki, Tomoki Yamashita

Publication date: 21 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.012

zbMATH Keywords

cycleindependence numberconnectivitycircumferencedegree sum

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large cycles in 4-connected graphs
• A degree sum condition concerning the connectivity and the independence number of a graph
• A degree sum condition with connectivity for relative length of longest paths and cycles
• A generalization of a result of Häggkvist and Nicoghossian
• A lower bound for the circumference of a graph
• Cycles through subsets with large degree sums
• On the circumference of 3-connected graphs
• A note on Hamiltonian circuits
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• A degree sum condition for longest cycles in 3-connected graphs
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Cycles through particular subgraphs of claw‐free graphs

This page was built for publication: Degree sum conditions for the circumference of 4-connected graphs