Degree sum conditions for the circumference of 4-connected graphs

DOI10.1016/J.DISC.2014.06.012MaRDI QIDQ400404zbMATHOpenAlexFDO

Authors 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

circumferenceconnectivitycycledegree sumindependence number

Mathematics Subject Classification ID

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

Recommendations

• A degree condition for the circumference of a graph
• A degree condition for the circumference of a graph
• Some degree bounds for the circumference of graphs
• On the circumference of essentially 4-connected planar graphs
• Degree sum and connectivity conditions for dominating cycles
• Circumference of Graphs with Bounded Degree
• Degree bounds for the circumference of 3‐connected graphs
• Degree sum conditions and vertex-disjoint cycles in a graph
• Two upper bounds for the degree distances of four sums of graphs
• Degree sum conditions on two disjoint cycles in graphs

Cites work

• scientific article; zbMATH DE number 47161 (Why is no real title available?)
• scientific article; zbMATH DE number 3515497 (Why is no real title available?)
• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• A degree sum condition concerning the connectivity and the independence number of a graph
• A degree sum condition for longest cycles in 3-connected graphs
• 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
• A note on Hamiltonian circuits
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Cycles through particular subgraphs of claw‐free graphs
• Cycles through subsets with large degree sums
• Large cycles in 4-connected graphs
• Note on Hamilton Circuits
• On the circumference of 3-connected graphs
• Two sufficient conditions for dominating cycles

Cited in

(5)

• Large cycles in 4-connected graphs
• Degree bounds for the circumference of graphs
• scientific article; zbMATH DE number 270251 (Why is no real title available?)
• Longest cycles in 4-connected graphs
• A degree condition for the circumference of a graph

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

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