Keyword

girth

Description: In graph theory, girth is the length of a graph's shortest cycle.
Wikidata ID: wiki/Q959831
OpenAlex ID: keywords/girth
1988 · A. Lubotzky, R. Phillips, et al. · COMBINATORICA · 1,644
2005 · Xiao-Yu Hu, E. Eleftheriou, et al. · IEEE Transactions on Information Theory · 1,609
2001 · Y. Kou, S. Lin, et al. · IEEE Transactions on Information Theory · 1,386
2004 · M.P.C. Fossorier · IEEE Transactions on Information Theory · 1,347
2002 · Xiao-Yu Hu, E. Eleftheriou, et al. · Globecom · 538
1996 · J. Fàbrega, M.A. Fiol · Discrete Mathematics · 419
1999 · David Eppstein · Journal of Graph Algorithms and Applications · 378
1998 · Béla Bollobás · Graduate texts in mathematics · 349
· R. Michael Tanner, R. Michael, et al. · 285
1997 · O.V. Borodin, A.V. Kostochka, et al. · Journal of Combinatorial Theory Series B · 276
2011 · Jason Gallicchio, Matthew D. Schwartz · Physical Review Letters · 274
1982 · Larry J. Stockmeyer, Vijay V. Vazirani · Information Processing Letters · 261
2002 · Noga Alon, Shlomo Hoory, et al. · Graphs and Combinatorics · 253
1966 · Clark T. Benson · Canadian Journal of Mathematics · 233
1999 · Markus Meringer · Journal of Graph Theory · 221
1999 · R.E. Jones, R.J. Petrell, et al. · Aquacultural Engineering · 209
2011 · Geoffrey Exoo, Robert Jajcay · The Electronic Journal of Combinatorics · 203
1995 · Felix Lazebnik, Vasiliy A. Ustimenko · Discrete Applied Mathematics · 199
2011 · M. BEHBOODI, Z. RAKEEI · Journal of Algebra and Its Applications · 196
1982 · Pak‐Ken Wong · Journal of Graph Theory · 195
2012 · Stephan Holzer, Roger Wattenhofer · ACM Symposium on Principles of Distributed Computing (PODC) · 191
1977 · O.V Borodin, A.V Kostochka · Journal of Combinatorial Theory Series B · 186
2014 · Miklós Abért, Yair Glasner, et al. · Duke Mathematical Journal · 184
Works count: 4,296
Citation count: 59,600
Year
Topic
Type