Pages that link to "Item:Q2707978"
From MaRDI portal
The following pages link to New upper bounds for the chromatic number of a graph (Q2707978):
Displaying 6 items.
- Three new upper bounds on the chromatic number (Q765327) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- (Q6150893) (← links)
