Skip to search formSkip to main contentSkip to account menu

Robbins' theorem

Known as: Robbins theorem 
In graph theory, Robbins' theorem, named after Herbert Robbins (), states that the graphs that have strong orientations are exactly the 2-edge… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A grid is a large-scale geographically distributed hardware and software infra-structure composed of heterogeneous networked… 
2010
2010
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of… 
1999
1999
We consider finite, loopless graphs or digraphs, without multiple edges or arcs (with no pairs of opposite arcs). Let G = (V,E… 
1995
1995
A famous result of Chow and Robbins [8] asserts that if ${X_n, n \geq 1}$ are independent and identically distributed (i.i.d… 
1987
1987
Many theorems in graph theory give simple characterizations for testing the existence of objects with certain properties, which…