Robbins' theorem
id:
robbins-theorem-249-6337015
title:
Robbins' theorem
text:
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 it 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Equivalence between strongly orientable graphs and bridgeless graphs
original url:
https://en.wikipedia.org/wiki/Robbins%27_theorem
date created:
date modified:
2023-01-29T23:34:59Z
main entity:
{"identifier":"Q7341043","url":"https://www.wikidata.org/entity/Q7341043"}
image:
fields total:
13
integrity:
14