bridge (Q2532492): Difference between revisions

@@ label / sl / label / sl @@
-Most
+most
@@ label / en / label / en @@
-Bridge
+bridge
@@ label / eo / label / eo @@
+ponto
@@ label / sk / label / sk @@
+most
@@ label / ro / label / ro @@
+Punte
@@ label / zh-tw / label / zh-tw @@
+橋
@@ label / zh-hant / label / zh-hant @@
+橋
@@ label / de / label / de @@
+Brücke
@@ label / cs / label / cs @@
+most
@@ aliases / sl / 0 / aliases / sl / 0 @@
+prerezna povezava
@@ aliases / sl / 1 / aliases / sl / 1 @@
-Prerezna povezava
@@ aliases / en / 0 / aliases / en / 0 @@
+graph bridge
@@ aliases / zh-tw / 0 / aliases / zh-tw / 0 @@
+切邊
@@ description / en / description / en @@
-An edge in a node-link graph whose removal would disconnect the graph
+edge in a node-link graph whose removal would disconnect the graph
@@ description / zh-tw / description / zh-tw @@
+移除會使圖不連通之邊
@@ description / zh / description / zh @@
+移除會使圖不連通之邊
@@ description / zh-hant / description / zh-hant @@
+移除會使圖不連通之邊
@@ description / cs / description / cs @@
+hrana v grafu, jejímž odebráním se zvětší počet komponent souvislosti
@@ description / sl / description / sl @@
+povezava v grafu vozlišč in povezav, katerega odstranitev bi prekinila graf
@@ description / de / description / de @@
+Kante, dessen Entfernen die Zahl der Zusammenhangskomponenten vergrößert
@@ Property / Library of Congress authority ID @@
+sh90003473
@@ Property / Library of Congress authority ID: sh90003473 / rank @@
+Normal rank
@@ Property / Library of Congress authority ID: sh90003473 / reference @@
+reference URL: https://github.com/JohnMarkOckerbloom/ftl/blob/master/data/wikimap
retrieved: 3 April 2019Timestamp +2019-04-03T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-04-03T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / instance of @@
+graph theory term
@@ Property / instance of: graph theory term / rank @@
+Normal rank
@@ Property / opposite of @@
+cut vertex
@@ Property / opposite of: cut vertex / rank @@
+Normal rank
@@ Property / subclass of @@
+edge
@@ Property / subclass of: edge / rank @@
+Normal rank
@@ Property / has characteristic @@
+edge-connectivity
@@ Property / has characteristic: edge-connectivity / rank @@
+Normal rank
@@ Property / has characteristic: edge-connectivity / qualifier @@
+in defining formula:  $k=1$ 
k=1
@@ Property / studied in @@
+graph theory
@@ Property / studied in: graph theory / rank @@
+Normal rank
@@ Property / Microsoft Academic ID @@
+100776233
@@ Property / Microsoft Academic ID: 100776233 / rank @@
+Normal rank
@@ Property / different from @@
+Most
@@ Property / different from: Most / rank @@
+Normal rank
@@ Property / different from: Most / reference @@
+imported from Wikimedia project: Polish Wikipedia
Wikimedia import URL: https://pl.wikipedia.org/w/index.php?title=Most_(teoria_grafów)&oldid=59522503
@@ Property / OpenAlex ID @@
+C100776233
@@ Property / OpenAlex ID: C100776233 / rank @@
+Normal rank
@@ Property / OpenAlex ID: C100776233 / reference @@
+stated in: OpenAlex
retrieved: 26 January 2022Timestamp +2022-01-26T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
reference URL: https://docs.openalex.org/download-snapshot/snapshot-data-format
-Timestamp
++2022-01-26T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / J9U ID @@
+987007530013105171
@@ Property / J9U ID: 987007530013105171 / rank @@
+Normal rank
@@ Property / J9U ID: 987007530013105171 / reference @@
+stated in: National Library of Israel Names and Subjects Authority File
@@ Property / maintained by WikiProject @@
+WikiProject Mathematics
@@ Property / maintained by WikiProject: WikiProject Mathematics / rank @@
+Normal rank
@@ links / urwiki / name / links / urwiki / name @@
-پُل (نظریہ گراف)
+پل (نظریہ گراف)
@@ links / dewiki / name / links / dewiki / name @@
+Brücke (Graphentheorie)
@@ links / dewiki / badges / 0 / links / dewiki / badges / 0 @@
+intentional sitelink to redirect