Graphs with Many Strong Orientations
暂无分享,去创建一个
[1] Dominic J. A. Welsh,et al. The Computational Complexity of the Tutte Plane: the Bipartite Case , 1992, Combinatorics, Probability and Computing.
[2] Robert E. Tarjan,et al. Strongly connected orientations of mixed multigraphs , 1985, Networks.
[3] Alan M. Frieze,et al. Electronic Colloquium on Computational Complexity Polynomial Time Randomised Approximation Schemes for Tutte-grr Othendieck Invariants: the Dense Case , 2022 .
[4] H. Robbins. A Theorem on Graphs, with an Application to a Problem of Traffic Control , 1939 .
[5] F. Boesch,et al. ROBBINS'S THEOREM FOR MIXED MULTIGRAPHS , 1980 .
[6] P. Buser. A note on the isoperimetric constant , 1982 .
[7] Peter Winkler,et al. On the number of Eulerian orientations of a graph , 2005, Algorithmica.
[8] Alan M. Frieze,et al. Optimal construction of edge-disjoint paths in random graphs , 1994, SODA '94.
[9] Larry Goldstein,et al. Size biased couplings and the spectral gap for random regular graphs , 2015, 1510.06013.
[10] Andrei Z. Broder,et al. On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Béla Bollobás,et al. The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..
[12] Joel Friedman,et al. A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.
[13] Michel Las Vergnas,et al. Convexity in oriented matroids , 1980, J. Comb. Theory B.
[14] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[15] H. Whitney. A Theorem on Graphs , 1931 .
[16] U. Feige,et al. Spectral Graph Theory , 2015 .