Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3115621> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Q3115621 subject Q7022818.
- Q3115621 subject Q7217193.
- Q3115621 abstract "In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.The vertex-connectivity, or just connectivity, of a graph is the largest k for which the graph is k-vertex-connected.".
- Q3115621 wikiPageExternalLink graph.theory.
- Q3115621 wikiPageExternalLink 1103037323.
- Q3115621 wikiPageWikiLink Q1304193.
- Q3115621 wikiPageWikiLink Q131476.
- Q3115621 wikiPageWikiLink Q1415372.
- Q3115621 wikiPageWikiLink Q17090559.
- Q3115621 wikiPageWikiLink Q172937.
- Q3115621 wikiPageWikiLink Q230655.
- Q3115621 wikiPageWikiLink Q2585642.
- Q3115621 wikiPageWikiLink Q3034655.
- Q3115621 wikiPageWikiLink Q32182.
- Q3115621 wikiPageWikiLink Q3823819.
- Q3115621 wikiPageWikiLink Q4046287.
- Q3115621 wikiPageWikiLink Q4390447.
- Q3115621 wikiPageWikiLink Q45715.
- Q3115621 wikiPageWikiLink Q5154570.
- Q3115621 wikiPageWikiLink Q547823.
- Q3115621 wikiPageWikiLink Q7022818.
- Q3115621 wikiPageWikiLink Q7217193.
- Q3115621 wikiPageWikiLink Q747980.
- Q3115621 wikiPageWikiLink Q7606897.
- Q3115621 wikiPageWikiLink Q7922780.
- Q3115621 wikiPageWikiLink Q928813.
- Q3115621 comment "In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed.The vertex-connectivity, or just connectivity, of a graph is the largest k for which the graph is k-vertex-connected.".
- Q3115621 label "K-vertex-connected graph".