Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Robbins'_theorem> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Robbins'_theorem abstract "In graph theory, Robbins' theorem, named after Herbert Robbins (1939), states that the graphs that have strong orientations are exactly the 2-edge-connected graphs. That is, it is possible to choose a direction for each edge of an undirected graph G, turning into a directed graph that has a path from every vertex to every other vertex, if and only if G is connected and has no bridge.".
- Robbins'_theorem thumbnail Ear_decomposition.png?width=300.
- Robbins'_theorem wikiPageExternalLink books?id=EYAwztXnzf8C&pg=PA7.
- Robbins'_theorem wikiPageExternalLink books?id=pOBXUoVZ9EEC&pg=PA135.
- Robbins'_theorem wikiPageID "36633800".
- Robbins'_theorem wikiPageRevisionID "506290831".
- Robbins'_theorem authorlink "Herbert Robbins".
- Robbins'_theorem first "Herbert".
- Robbins'_theorem hasPhotoCollection Robbins'_theorem.
- Robbins'_theorem last "Robbins".
- Robbins'_theorem year "1939".
- Robbins'_theorem subject Category:Graph_connectivity.
- Robbins'_theorem subject Category:Theorems_in_graph_theory.
- Robbins'_theorem comment "In graph theory, Robbins' theorem, named after Herbert Robbins (1939), states that the graphs that have strong orientations are exactly the 2-edge-connected graphs. That is, it is possible to choose a direction for each edge of an undirected graph G, turning into a directed graph that has a path from every vertex to every other vertex, if and only if G is connected and has no bridge.".
- Robbins'_theorem label "Robbins' theorem".
- Robbins'_theorem label "Teorema de Robbins".
- Robbins'_theorem sameAs Teorema_de_Robbins.
- Robbins'_theorem sameAs m.0kvfnvl.
- Robbins'_theorem sameAs Q7341043.
- Robbins'_theorem sameAs Q7341043.
- Robbins'_theorem wasDerivedFrom Robbins'_theorem?oldid=506290831.
- Robbins'_theorem depiction Ear_decomposition.png.
- Robbins'_theorem isPrimaryTopicOf Robbins'_theorem.