The following pages link to (Q3715148):
Displayed 13 items.
- Using tabu search techniques for graph coloring (Q580987) (← links)
- Maximum generic nullity of a graph (Q846315) (← links)
- Survival time of a random graph (Q918994) (← links)
- Expected values of parameters associated with the minimum rank of a graph (Q972786) (← links)
- On the order of the largest induced tree in a random graph (Q1088688) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- On the connectivity of random subsets of projective spaces (Q1297410) (← links)
- Turán's theorem and maximal degrees (Q1306430) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- The symmetry in the martingale inequality (Q1612953) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Integer sets with prescribed pairwise differences being distinct (Q1775027) (← links)
- The chromatic number of random graphs (Q5903892) (← links)