News

Further results of the paper are: (i) the existence of a continuum of different sensible graph theories strictly included in B (this result positively answers question 2 in [7, Section 6.3]); (ii) the ...
The k-edge-connectivity augmentation problem for a specified set of vertices (kECA-SV) is defined as follows: "Given an undirected graph G=(V, E), a subgraph G'=(V, E') of G, a specified set of ...