Sharp bounds on the order, size, and stability number of graphs
From MaRDI portal
Publication:5287443
DOI10.1002/net.3230230204zbMath0781.05030OpenAlexW2051347013MaRDI QIDQ5287443
Publication date: 5 September 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230204
Related Items (6)
New bounds on the independence number of connected graphs ⋮ Partitions of graphs into small and large sets ⋮ An improved lower bound on the independence number of a graph ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree ⋮ The \(k\)-regular induced subgraph problem ⋮ Computers and discovery in algebraic graph theory
Uses Software
This page was built for publication: Sharp bounds on the order, size, and stability number of graphs
