Modular Orientations of Random and Quasi-Random Regular Graphs
暂无分享,去创建一个
[1] N. Wormald. Models of random regular graphs , 2010 .
[2] Noga Alon,et al. On the second eigenvalue of a graph , 1991, Discret. Math..
[3] N. Wormald,et al. Models of the , 2010 .
[4] Noga A Lon,et al. MaxCut in H-Free Graphs , 2005 .
[5] Benny Sudakov,et al. Nowhere-Zero Flows in Random Graphs , 2001, J. Comb. Theory, Ser. B.
[6] Ricardo Dahab,et al. 3-flow Conjecture and Matchings in Bipartite Graphs , 2005, Ars Comb..
[7] W. T. Tutte. On the algebraic theory of graph colorings , 1966 .
[8] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[9] S. Hakimi. On the degrees of the vertices of a directed graph , 1965 .
[10] Hong-Jian Lai,et al. Nowhere-zero 3-flows of highly connected graphs , 1992, Discret. Math..
[11] Hong-Jian Lai,et al. On mod (2p+1)-orientations of graphs , 2009, J. Comb. Theory, Ser. B.
[12] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .
[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[14] N. Alon,et al. The Probabilistic Method: Alon/Probabilistic , 2008 .
[15] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[16] N. Alon,et al. MaxCut in ${\bm H)$-Free Graphs , 2005, Combinatorics, Probability and Computing.
[17] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[18] Paul Seymour,et al. Nowhere-zero flows , 1996 .
[19] R. Graham,et al. Handbook of Combinatorics , 1995 .
[20] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[21] Joel Friedman,et al. A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.
[22] Noga Alon,et al. Additive bases of vector spaces over prime fields , 1991, J. Comb. Theory, Ser. A.
[23] Noga Alon,et al. Explicit construction of linear sized tolerant networks , 1988, Discret. Math..