Degree sum conditions for the circumference of 4-connected graphs

DOI10.1016/J.DISC.2014.06.012zbMATH Open1298.05182OpenAlexW1989719007MaRDI QIDQ400404FDOQ400404

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

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

zbMATH Keywords

circumferenceconnectivitycycledegree sumindependence number

Mathematics Subject Classification ID

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

Cites Work

• Note on Hamilton Circuits
• A note on Hamiltonian circuits
• Title not available (Why is that?)
• 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
• Two sufficient conditions for dominating cycles
• A degree sum condition for longest cycles in 3-connected graphs
• Cycles through particular subgraphs of claw‐free graphs
• Title not available (Why is that?)
• On the circumference of 3-connected graphs
• Title not available (Why is that?)
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Large cycles in 4-connected graphs

Cited In (4)

• Large cycles in 4-connected graphs
• Longest cycles in 4-connected graphs
• Title not available (Why is that?)
• 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)