Pages that link to "Item:Q2255044"
From MaRDI portal
The following pages link to New potential functions for greedy independence and coloring (Q2255044):
Displayed 5 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)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)