Keyword

d-regular graphs

Description: Graphs in which every vertex has degree d, studied in graph theory and discrete mathematics.
OpenAlex ID: keywords/d-regular-graphs
1996 · P. Diaconis, L. Saloff-Coste · The Annals of Applied Probability · 592
1991 · A. Nilli · Discrete Mathematics · 406
1987 · T. N. Bui, S. Chaudhuri, et al. · COMBINATORICA · 367
2010 · Prasad Raghavendra, David Steurer · ACM Symposium on Theory of Computing (STOC) · 351
1999 · A. STEGER, N. C. WORMALD · Combinatorics Probability Computing · 300
2003 · Joel Friedman · ACM Symposium on Theory of Computing (STOC) · 275
2006 · Yonatan Bilu, Nathan Linial · COMBINATORICA · 274
2002 · Noga Alon, Shlomo Hoory, et al. · Graphs and Combinatorics · 253
1994 · R. W. Robinson, N. C. Wormald · Random Structures and Algorithms · 252
1988 · Béla Bollobás · European Journal of Combinatorics · 236
1982 · Béla Bollobás, W. Fernandez de la Vega · COMBINATORICA · 207
2014 · Allan Sly, Nike Sun · The Annals of Probability · 182
2007 · S. Barik, S. Pati, et al. · SIAM Journal on Discrete Mathematics · 179
2014 · David Gamarnik, Madhu Sudan · Conference on Innovations in Theoretical Computer Science · 172
1994 · Madhav Desai, Vasant Rao · Journal of Graph Theory · 161
2009 · Mohsen Bayati, Jeong Han Kim, et al. · Algorithmica · 155
1981 · Nicholas C. Wormald · Journal of Combinatorial Theory Series B · 152
1987 · Andrei Broder, Eli Shamir · Annual Symposium on Foundations of Computer Science · 136
2008 · Elchanan Mossel, Dror Weitz, et al. · Probability Theory and Related Fields · 135
2009 · YUFEI ZHAO · Combinatorics Probability Computing · 130
2001 · Michael Krivelevich, Benny Sudakov, et al. · Random Structures and Algorithms · 128
2002 · Michael Krivelevich, Benny Sudakov · Journal of Graph Theory · 127
1999 · Bartholdi, Laurent · Archive ouverte UNIGE (University of Geneva) · 125
1997 · Carlo Blundo, Alfredo De Santis, et al. · Designs Codes and Cryptography · 123
Works count: 817
Citation count: 14,650
Year
Topic
Type