In the article titled Color-avoiding connected spanning subgraphs with minimum number of edges, the authors, our PhD student József Pintér and our affiliate Kitti Varga investigate the problem of determining the maximum number of edges that can be removed from either an edge- or a vertex-colored, color-avoiding connected graph so that it remains color-avoiding connected.