On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs

DOI10.1016/0012-365X(92)90035-EzbMath0755.05035MaRDI QIDQ1196745

T. E. Lindquester, Michael S. Jacobson, Ronald J. Gould, Ralph J. Faudree, Linda Lesniak

Publication date: 16 January 1993

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

zbMATH Keywords

independence number\(K(1,m)\)-free graphsindependent generalized degreesneighbourhood union

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Claw-free graphs---a survey ⋮ Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ Generalized pancyclic properties in claw-free graphs ⋮ Independence and upper irredundance in claw-free graphs ⋮ A greedy partition lemma for directed domination ⋮ Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs ⋮ Partial domination - the isolation number of a graph ⋮ On lower bounds for the chromatic number in terms of vertex degree ⋮ Unnamed Item ⋮ Zero forcing in claw-free cubic graphs ⋮ A generalization of Dirac's theorem for \(K(1,3)\)-free graphs ⋮ On the independence number in \(K_{1,r+1}\)-free graphs

Cites Work

• Neighbourhood unions and Hamiltonian properties in graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Neighborhood unions and a generalization of Dirac's theorem
• Longest paths and cycles in K1,3-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item