Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs

DOI10.1016/S0012-365X(96)00175-6zbMath0872.05024WikidataQ126977117 ScholiaQ126977117MaRDI QIDQ1356749

Y. Redouane, Odile Favaron

Publication date: 7 October 1997

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

zbMATH Keywords

independence numberindependent set\(t\)-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbourhood unions and Hamiltonian properties in graphs
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• A generalization of Ore's Theorem involving neighborhood unions
• Cycles in graphs with prescribed stability number and connectivity
• On the independence number in \(K_{1,r+1}\)-free graphs
• Neighborhood unions and hamiltonicity of graphs
• A new sufficient condition for hamiltonian graphs
• Extremal problems involving neighborhood unions
• Neighborhood unions and hamilton cycles
• A chvátal–erdős type condition for hamiltonian graphs
• Neighborhood unions and regular factors
• Generalized degree conditions for graphs with bounded independence number
• Hamiltonicity for K_{1, r}‐free graphs

This page was built for publication: Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs