Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
girth
Description:
In graph theory, girth is the length of a graph's shortest cycle.
Primary topic:
Advanced Graph Theory Research (31%)
Related topics:
Advanced Graph Theory Research (31%),
Error Correcting Code Techniques (13%),
Limits and Structures in Graph Theory (9%),
Graph theory and applications (8%),
Rings, Modules, and Algebras (7%)
Wikidata ID:
wiki/Q959831
OpenAlex ID:
keywords/girth
Ramanujan graphs
1988
·
A. Lubotzky
, R. Phillips
, et al.
·
COMBINATORICA
·
1,644
Regular and irregular progressive edge-growth tanner graphs
2005
·
Xiao-Yu Hu
, E. Eleftheriou
, et al.
·
IEEE Transactions on Information Theory
·
1,609
Low-density parity-check codes based on finite geometries: a rediscovery and new results
2001
·
Y. Kou
, S. Lin
, et al.
·
IEEE Transactions on Information Theory
·
1,386
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
2004
·
M.P.C. Fossorier
·
IEEE Transactions on Information Theory
·
1,347
Progressive edge-growth Tanner graphs
2002
·
Xiao-Yu Hu
, E. Eleftheriou
, et al.
·
Globecom
·
538
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
1984
·
Michele Conforti
, Gérard Cornuéjols
·
Discrete Applied Mathematics
·
445
On the extraconnectivity of graphs
1996
·
J. Fàbrega
, M.A. Fiol
·
Discrete Mathematics
·
419
PDF
Subgraph Isomorphism in Planar Graphs and Related Problems
1999
·
David Eppstein
·
Journal of Graph Algorithms and Applications
·
378
Explicit constructions of graphs without short cycles and low density codes
1982
·
G. A. Margulis
·
COMBINATORICA
·
353
Random Graphs
1998
·
Béla Bollobás
·
Graduate texts in mathematics
·
349
A Class of Group-Structured LDPC Codes
·
R. Michael Tanner
, R. Michael
, et al.
·
285
List Edge and List Total Colourings of Multigraphs
1997
·
O.V. Borodin
, A.V. Kostochka
, et al.
·
Journal of Combinatorial Theory Series B
·
276
Quark and Gluon Tagging at the LHC
2011
·
Jason Gallicchio
, Matthew D. Schwartz
·
Physical Review Letters
·
274
PDF
NP-completeness of some generalizations of the maximum matching problem
1982
·
Larry J. Stockmeyer
, Vijay V. Vazirani
·
Information Processing Letters
·
261
The Moore Bound for Irregular Graphs
2002
·
Noga Alon
, Shlomo Hoory
, et al.
·
Graphs and Combinatorics
·
253
Minimal Regular Graphs of Girths Eight and Twelve
1966
·
Clark T. Benson
·
Canadian Journal of Mathematics
·
233
PDF
Fast generation of regular graphs and construction of cages
1999
·
Markus Meringer
·
Journal of Graph Theory
·
221
Using modified length–weight relationships to assess the condition of fish
1999
·
R.E. Jones
, R.J. Petrell
, et al.
·
Aquacultural Engineering
·
209
Dynamic Cage Survey
2011
·
Geoffrey Exoo
, Robert Jajcay
·
The Electronic Journal of Combinatorics
·
203
Explicit construction of graphs with an arbitrary large girth and of large size
1995
·
Felix Lazebnik
, Vasiliy A. Ustimenko
·
Discrete Applied Mathematics
·
199
PDF
The Annihilating-ideal Graph of Commutative Rings I
2011
·
M. BEHBOODI
, Z. RAKEEI
·
Journal of Algebra and Its Applications
·
196
PDF
Cages—a survey
1982
·
Pak‐Ken Wong
·
Journal of Graph Theory
·
195
Optimal distributed all pairs shortest paths and applications
2012
·
Stephan Holzer
, Roger Wattenhofer
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
191
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
1977
·
O.V Borodin
, A.V Kostochka
·
Journal of Combinatorial Theory Series B
·
186
Kesten’s theorem for invariant random subgroups
2014
·
Miklós Abért
, Yair Glasner
, et al.
·
Duke Mathematical Journal
·
184
PDF
Show more works
View as search
Works count:
4,296
Citation count:
59,600
Year
Topic
Type