Pages that link to "Item:Q1175993"

The following pages link to Lower bounds on the stability number of graphs computed in terms of degrees (Q1175993):

Displaying 14 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• Largest domination number and smallest independence number of forests with given degree sequence (Q277645) (← links)
• Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
• On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
• Computing independent sets in graphs with large girth (Q1183338) (← links)
• The independence number of graphs in terms of degrees (Q1313874) (← links)
• A lower bound on the independence number of a graph (Q1584341) (← links)
• New potential functions for greedy independence and coloring (Q2255044) (← links)
• Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
• New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
• RECOGNIZING BY ORDER AND DEGREE PATTERN OF SOME PROJECTIVE SPECIAL LINEAR GROUPS (Q4649512) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)