An improved lower bound on the independence number of a graph

DOI10.1016/j.dam.2014.07.001zbMath1303.05137OpenAlexW2081617938MaRDI QIDQ477342

Christian Löwenstein, Michael A. Henning

Publication date: 3 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.07.001

zbMATH Keywords

independencevertex-cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

New bounds on the independence number of connected graphs ⋮ Bounds on the independence number of a graph in terms of order, size and maximum degree

Cites Work

• Unnamed Item
• Unnamed Item
• A new lower bound on the independence number of a graph and applications
• A lower bound on independence in terms of degrees
• Lower bounds on the independence number of certain graphs of odd girth at least seven
• Independence in connected graphs
• Independence in graphs with maximum degree four
• The independence number in graphs of maximum degree three
• Independence, clique size and maximum degree
• Lower bounds on the independence number in terms of the degrees
• On the independent domination number of regular graphs
• Independent domination in graphs: A survey and recent results
• A new lower bound on the independence number of graphs
• Independence, odd girth, and average degree
• The potential of greed for independence
• New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
• Sharp bounds on the order, size, and stability number of graphs
• On the theory of graphs
• On the independence number of a graph in terms of order and size

This page was built for publication: An improved lower bound on the independence number of a graph