Pages that link to "Item:Q1927697"
From MaRDI portal
The following pages link to Greedy algorithms for triangle free coloring (Q1927697):
Displaying 5 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- (Q3684143) (← links)
- (Q5155414) (← links)