On the independence number in \(K_{1,r+1}\)-free graphs

DOI10.1016/0012-365X(94)00218-8zbMath0826.05046MaRDI QIDQ1842181

Ingo Schiermeyer, Zdeněk Ryjáček

Publication date: 26 November 1995

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

zbMATH Keywords

upper boundsindependence numberdegree sequencevertex connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ On local and global independence numbers of a graph ⋮ Independence and upper irredundance in claw-free graphs ⋮ Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes

Cites Work

• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• Traversability and connectivity of the middle graph of a graph
• Almost claw‐free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the independence number in \(K_{1,r+1}\)-free graphs