k-edge-connected graph

graph that remains connected whenever fewer than k edges are removed

en-GB/ˈkeɪ - ˈɛd͡ʒ - kəˈnɛktɪd ɡɹɑːf/
en-US/ˈkeɪ - ˈɛd͡ʒ - kəˈnɛktɪd ˈɡɹæf/

Kategoriler:

connected graph