//-->
A wide-ranging computational comparison of high-performance graph colouring algorithms
Lewis, R., (2012)
Computational and theoretical challenges for computing the minimum rank of a graph
Hicks, Illya V., (2022)
Models of computation for graph theoretic problems
Turán, György, (1983)
Computing the Grothendieck constant of some graph classes
Laurent, M., (2011)
Semidefinite approximations for bicliques and bi-independent pairs
Laurent, Monique, (2025)
Some new classes of facets for the equicut polytope
DeSouza, C. C., (1991)