We explore 2-connected (biconnected) graphs and broadcasting in them. Using Whitney’s open ear decomposition in an inductive proof we propose broadcast schemes that achieve an upper bound of ⌈n/2⌉ for ...

This work is devoted to the problem of spanning trees maintenance in the presence of crash failures in a distributed environment using only local knowledge. Using a pre-constructed spanning tree of a ...

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, ...