About: K-edge-connected graph

Property	Value
dbo:description	Begriff in der Graphentheorie (de) graph that remains connected whenever fewer than k edges are removed (en) граф, который остаётся связным после удаления не более чем k-1 рёбер (ru) olyan gráf, mely bármely k‒1 él elhagyásával is összefüggő marad (hu)
dbo:thumbnail	wiki-commons:Special:FilePath/2-edge_connected_graph.svg?width=300
dbo:wikiPageWikiLink	dbr:Glossary_of_graph_theory dbr:Dual_graph dbc:Graph_connectivity dbr:Max-flow_min-cut_theorem dbr:Maximum_flow_problem dbr:Menger's_theorem dbr:Cut_(graph_theory) dbr:Matroid_theory dbr:Camille_Jordan dbr:Connectivity_(graph_theory) dbr:Flow_network dbr:Vertex_(graph_theory) dbr:Graph_enumeration dbr:Graphic_matroid dbr:Graph_theory dbr:Girth_(graph_theory) dbr:Bridge_(graph_theory) dbr:K-vertex-connected_graph dbr:Robbins'_theorem dbr:Strong_orientation dbr:Minimum_cut dbr:Degree_(graph_theory) dbr:Graph_(discrete_mathematics) dbc:Graph_families dbr:Planar_graph dbr:Randomized_algorithm dbr:Karger's_algorithm dbr:Ear_decomposition dbr:Matroid_girth dbr:Harold_N._Gabow dbr:Matching_preclusion dbr:File:2-edge_connected_graph.svg
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Mvar dbt:Short_description
dct:subject	dbc:Graph_connectivity dbc:Graph_families
gold:hypernym	dbr:K
rdfs:label	K-edge-connected graph (en) Kantenzusammenhang (de) Graphe arête-connexe (fr) K-辺連結グラフ (ja) Grafo k-aresta-conexo (pt) Рёберно k-связный граф (ru) K-реберно-зв'язний граф (uk)
owl:sameAs	freebase:K-edge-connected graph yago-res:K-edge-connected graph wikidata:K-edge-connected graph dbpedia-de:K-edge-connected graph dbpedia-fr:K-edge-connected graph dbpedia-ja:K-edge-connected graph dbpedia-pt:K-edge-connected graph dbpedia-hu:K-edge-connected graph dbpedia-ru:K-edge-connected graph dbpedia-uk:K-edge-connected graph dbpedia-global:K-edge-connected graph dbr:K-edge-connected graph
prov:wasDerivedFrom	wikipedia-en:K-edge-connected_graph?oldid=1232757352&ns=0
foaf:depiction	wiki-commons:Special:FilePath/2-edge_connected_graph.svg
foaf:isPrimaryTopicOf	wikipedia-en:K-edge-connected_graph
is dbo:knownFor of	dbr:Camille_Jordan
is dbo:wikiPageRedirects of	dbr:Edge_connectivity dbr:Edge-connectivity
is dbo:wikiPageWikiLink of	dbr:Glossary_of_graph_theory dbr:Balaban_10-cage dbr:Edge_coloring dbr:Dual_graph dbr:Balaban_11-cage dbr:Menger's_theorem dbr:McGee_graph dbr:Petersen's_theorem dbr:Camille_Jordan dbr:Steiner_tree_problem dbr:F26A_graph dbr:Factor-critical_graph dbr:Girth_(graph_theory) dbr:Bridge_(graph_theory) dbr:Klein_graphs dbr:Edge_connectivity dbr:Strongly_connected_component dbr:Biggs–Smith_graph dbr:Butterfly_graph dbr:Edge-connectivity dbr:Brinkmann_graph dbr:Bull_graph dbr:Coxeter_graph dbr:Desargues_graph dbr:Diamond_graph dbr:Dyck_graph dbr:Errera_graph dbr:Folkman_graph dbr:Foster_graph dbr:Franklin_graph dbr:Goldner–Harary_graph dbr:Gray_graph dbr:Harries_graph dbr:Harries–Wong_graph dbr:Herschel_graph dbr:Hoffman_graph dbr:Holt_graph dbr:Horton_graph dbr:K-vertex-connected_graph dbr:Meredith_graph dbr:Nauru_graph dbr:Pappus_graph dbr:Robertson_graph dbr:Triangle_graph dbr:Wagner_graph dbr:Crispin_Nash-Williams dbr:Robbins'_theorem dbr:Minimum_cut dbr:Orientation_(graph_theory) dbr:Graph_(discrete_mathematics) dbr:Clebsch_graph dbr:Critical_graph dbr:Ear_decomposition dbr:Nash-Williams_theorem dbr:Matroid_girth dbr:Split_(graph_theory) dbr:Pseudorandom_graph dbr:Harborth's_conjecture
is dbp:knownFor of	dbr:Camille_Jordan
is foaf:primaryTopic of	wikipedia-en:K-edge-connected_graph