Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,778,261 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Bridge (graph theory)
Communications of the ACM
Directed graph
Ear decomposition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Oriented Diameter of Grids
I. Rajasingh
,
R. S. Rajan
,
M. Rajesh
,
and Paul Manuel
2014
Corpus ID: 17537052
A grid is a large-scale geographically distributed hardware and software infra-structure composed of heterogeneous networked…
Expand
2013
2013
Strongly connected orientations of plane graphs
E. Kranakis
,
Oscar Morales-Ponce
,
L. Stacho
Discrete Applied Mathematics
2013
Corpus ID: 37313414
2010
2010
Lattice of Integer Flows and Poset of Strongly Connected Orientations
O. Amini
2010
Corpus ID: 115626471
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of…
Expand
1999
1999
On strongly connected orientations of graphs
Matús Harminc
Discussiones Mathematicae Graph Theory
1999
Corpus ID: 28572408
We consider finite, loopless graphs or digraphs, without multiple edges or arcs (with no pairs of opposite arcs). Let G = (V,E…
Expand
1995
1995
An extension of the hong-park version of the chow-robbins theorem on sums of nonintegrable random variables
A. Adler
,
A. Rosalsky
1995
Corpus ID: 117772591
A famous result of Chow and Robbins [8] asserts that if ${X_n, n \geq 1}$ are independent and identically distributed (i.i.d…
Expand
1987
1987
Fast Parallel Algorithms for Graphs and Networks
D. Soroker
1987
Corpus ID: 118374328
Many theorems in graph theory give simple characterizations for testing the existence of objects with certain properties, which…
Expand
1979
1979
Generalized t-Designs and Weighted Majority Decoding
R. Safavi-Naini
,
I. Blake
Information and Control
1979
Corpus ID: 45454125
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE