Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bridge_(graph_theory)> ?p ?o }
Showing triples 1 to 68 of
68
with 100 triples per page.
- Bridge_(graph_theory) abstract "In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases its number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. A graph is said to be bridgeless or isthmus-free if it contains no bridges.Another meaning of \"bridge\" appears in the term bridge of a subgraph. If H is a subgraph of G, a bridge of H in G is a maximal subgraph of G that is not contained in H and is not separated by H.".
- Bridge_(graph_theory) thumbnail Graph_cut_edges.svg?width=300.
- Bridge_(graph_theory) wikiPageID "1305071".
- Bridge_(graph_theory) wikiPageLength "9048".
- Bridge_(graph_theory) wikiPageOutDegree "33".
- Bridge_(graph_theory) wikiPageRevisionID "702633160".
- Bridge_(graph_theory) wikiPageWikiLink Biconnected_component.
- Bridge_(graph_theory) wikiPageWikiLink Category:Graph_connectivity.
- Bridge_(graph_theory) wikiPageWikiLink Chain_decomposition.
- Bridge_(graph_theory) wikiPageWikiLink Chain_decompositions.
- Bridge_(graph_theory) wikiPageWikiLink Connected_component_(graph_theory).
- Bridge_(graph_theory) wikiPageWikiLink Cubic_graph.
- Bridge_(graph_theory) wikiPageWikiLink Cycle_(graph_theory).
- Bridge_(graph_theory) wikiPageWikiLink Cycle_double_cover.
- Bridge_(graph_theory) wikiPageWikiLink Depth-first_search.
- Bridge_(graph_theory) wikiPageWikiLink Ear_decomposition.
- Bridge_(graph_theory) wikiPageWikiLink Equivalence_relation.
- Bridge_(graph_theory) wikiPageWikiLink George_Szekeres.
- Bridge_(graph_theory) wikiPageWikiLink Glossary_of_graph_theory.
- Bridge_(graph_theory) wikiPageWikiLink Graph_(discrete_mathematics).
- Bridge_(graph_theory) wikiPageWikiLink Graph_theory.
- Bridge_(graph_theory) wikiPageWikiLink K-edge-connected_graph.
- Bridge_(graph_theory) wikiPageWikiLink K-vertex-connected_graph.
- Bridge_(graph_theory) wikiPageWikiLink Paul_Seymour_(mathematician).
- Bridge_(graph_theory) wikiPageWikiLink Robbins_theorem.
- Bridge_(graph_theory) wikiPageWikiLink Robert_Tarjan.
- Bridge_(graph_theory) wikiPageWikiLink Spanning_tree.
- Bridge_(graph_theory) wikiPageWikiLink Strong_orientation.
- Bridge_(graph_theory) wikiPageWikiLink Time_complexity.
- Bridge_(graph_theory) wikiPageWikiLink Tree_(graph_theory).
- Bridge_(graph_theory) wikiPageWikiLink Tree_traversal.
- Bridge_(graph_theory) wikiPageWikiLink File:Graph_cut_edges.svg.
- Bridge_(graph_theory) wikiPageWikiLink File:Undirected.svg.
- Bridge_(graph_theory) wikiPageWikiLinkText "2-edge-connected".
- Bridge_(graph_theory) wikiPageWikiLinkText "Bridge (graph theory)".
- Bridge_(graph_theory) wikiPageWikiLinkText "Bridge (graph theory)#Bridgeless graphs".
- Bridge_(graph_theory) wikiPageWikiLinkText "Bridge".
- Bridge_(graph_theory) wikiPageWikiLinkText "Bridgeless".
- Bridge_(graph_theory) wikiPageWikiLinkText "bridge".
- Bridge_(graph_theory) wikiPageWikiLinkText "bridgeless graphs".
- Bridge_(graph_theory) wikiPageWikiLinkText "bridgeless".
- Bridge_(graph_theory) wikiPageWikiLinkText "bridges".
- Bridge_(graph_theory) wikiPageWikiLinkText "cut edges".
- Bridge_(graph_theory) wikiPageWikiLinkText "isthmus".
- Bridge_(graph_theory) wikiPageWikiLinkText "traversing rule".
- Bridge_(graph_theory) wikiPageUsesTemplate Template:Reflist.
- Bridge_(graph_theory) subject Category:Graph_connectivity.
- Bridge_(graph_theory) hypernym Edge.
- Bridge_(graph_theory) type Agent.
- Bridge_(graph_theory) type Invariant.
- Bridge_(graph_theory) comment "In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases its number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. A graph is said to be bridgeless or isthmus-free if it contains no bridges.Another meaning of \"bridge\" appears in the term bridge of a subgraph. If H is a subgraph of G, a bridge of H in G is a maximal subgraph of G that is not contained in H and is not separated by H.".
- Bridge_(graph_theory) label "Bridge (graph theory)".
- Bridge_(graph_theory) sameAs Q2532492.
- Bridge_(graph_theory) sameAs Arista_de_corte.
- Bridge_(graph_theory) sameAs پل_(نظریه_گراف).
- Bridge_(graph_theory) sameAs Isthme_(théorie_des_graphes).
- Bridge_(graph_theory) sameAs Ponte_(teoria_dei_grafi).
- Bridge_(graph_theory) sameAs Most_(teoria_grafów).
- Bridge_(graph_theory) sameAs Ponte_(teoria_dos_grafos).
- Bridge_(graph_theory) sameAs m.02p44kw.
- Bridge_(graph_theory) sameAs Мост_(теория_графов).
- Bridge_(graph_theory) sameAs Most_(teorija_grafov).
- Bridge_(graph_theory) sameAs Міст_(теорія_графів).
- Bridge_(graph_theory) sameAs Q2532492.
- Bridge_(graph_theory) sameAs 桥_(图论).
- Bridge_(graph_theory) wasDerivedFrom Bridge_(graph_theory)?oldid=702633160.
- Bridge_(graph_theory) depiction Graph_cut_edges.svg.
- Bridge_(graph_theory) isPrimaryTopicOf Bridge_(graph_theory).