An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Edge of a graph whose deletion increases the graph’s number of connected components; equivalently, an edge not contained in any cycle

Property Value
dbo:description
  • グラフ理論 (ja)
  • hrana v grafu, jejímž odebráním se zvětší počet komponent souvislosti (cs)
  • conceito da teoria dos grafos (pt)
  • concetto di teoria dei grafi (it)
  • eĝo ne apartenanta en ajna ciklo (eo)
  • povezava v grafu vozlišč in povezav, katerega odstranitev bi prekinila graf (sl)
  • ребро в теории графов, удаление которого увеличивает число компонент связности (ru)
  • edge of a graph whose deletion increases the graph’s number of connected components; equivalently, an edge not contained in any cycle (en)
  • Kante, dessen Entfernen die Zahl der Zusammenhangskomponenten vergrößert (de)
  • 移除會使圖不連通之邊 (zh)
  • olyan él egy nem feltétlenül összefüggő gráfban, melynek elhagyásával a gráf komponenseinek száma növekszik (hu)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdfs:label
  • Bridge (graph theory) (en)
  • Ponto (grafeteorio) (eo)
  • Brücke (Graphentheorie) (de)
  • Isthme (théorie des graphes) (fr)
  • Arista de corte (es)
  • Ponte (teoria dei grafi) (it)
  • Most (teoria grafów) (pl)
  • Ponte (teoria dos grafos) (pt)
  • Міст (теорія графів) (uk)
  • Мост (теория графов) (ru)
  • 桥 (图论) (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International