A degree sum condition concerning the connectivity and the independence number of a graph

DOI10.1007/S00373-008-0802-ZzbMath1176.05044OpenAlexW2029635940MaRDI QIDQ1014827

Kenta Ozeki, Tomoki Yamashita

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0802-z

zbMATH Keywords

connectivityindependence number of a graph

Mathematics Subject Classification ID

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

Related Items (7)

A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ Degree sum conditions for cyclability in bipartite graphs ⋮ A \(k\)-tree containing specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Independence number and \(k\)-trees of graphs ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ A note on the independence number, connectivity and \(k\)-ended tree

Cites Work

• Unnamed Item
• A generalization of a result of Häggkvist and Nicoghossian
• A remark on two sufficient conditions for Hamilton cycles
• Cycles through subsets with large degree sums
• Cycles through prescribed vertices with large degree sum
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions
• Cyclability of 3-connected graphs

This page was built for publication: A degree sum condition concerning the connectivity and the independence number of a graph