Pages that link to "Item:Q2255044"
From MaRDI portal
The following pages link to New potential functions for greedy independence and coloring (Q2255044):
Displaying 8 items.
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- The potential of greed for independence (Q4650180) (← links)
- Improving the Caro-Wei bound and applications to Turán stability (Q6611049) (← links)