Matches in DBpedia 2016-04 for { ?s ?p "In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected."@en }
Showing triples 1 to 4 of
4
with 100 triples per page.
- K-edge-connected_graph abstract "In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.".
- Q3034655 abstract "In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.".
- K-edge-connected_graph comment "In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.".
- Q3034655 comment "In graph theory, a connected graph is k-edge-connected if it remains connected whenever fewer than k edges are removed.The edge-connectivity of a graph is the largest k for which the graph is k-edge-connected.".