Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

2015 Submissions Journal Paper Ferrara, Michael, et al. "Graph Saturation in Multipartite Graphs." Journal of Combinatorics 7. 1 (2016): 1-19. Print. * 2014 Submissions Journal Paper MacDonald, Lori, ...

We use random sampling as a tool for solving undirected graph problems. We show that the sparse graph, or skeleton, that arises when we randomly sample a graph's edges will accurately approximate the ...