{"version":"1.0","type":"link","title":"Edge connectivity - Newikis","description":"In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}