Pages that link to "Item:Q283679"
From MaRDI portal
The following pages link to An approximate algorithm for the chromatic number of graphs (Q283679):
Displaying 9 items.
- Approximation results for the minimum graph coloring problem (Q1321829) (← links)
- Three-quarter approximation for the number of unused colors in graph coloring (Q1818979) (← links)
- New algorithm for calculating chromatic index of graphs and its applications (Q2338156) (← links)
- (Q3166186) (← links)
- (Q4411283) (← links)
- (Q4433447) (← links)
- (Q4938783) (← links)
- New Algorithm for Chromatic Number of Graphs and their Applications (Q5220289) (← links)
- On the hardness of approximating the chromatic number (Q5932643) (← links)