8 search results - page 2 / 2 » combinatorica 1999 |
52
Voted
COMBINATORICA
1999
14 years 11 months ago
1999
80
Voted
COMBINATORICA
1999
14 years 11 months ago
1999
We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite. Graphs are represented by incidence lists of bounded len...
COMBINATORICA
2004
14 years 11 months ago
2004
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...