# Girth (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Information Theory
- 2006

One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girthâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Information Theory
- 2006

In this correspondence, we present a method for constructing sparse matrices that have a compact description and whose associatedâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections betweenâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- SODA
- 2005

We investigate the importance of space when solving problems based on graph distance in the streaming model. In this model, theâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- GLOBECOM
- 2001

We propose a general method for constructing Tanner graphs with large girth by progressively establishing edges or connectionsâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Journal of Graph Theory
- 2001

A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromaticâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Discrete Applied Mathematics
- 1995

Let k â‰¥ 3 be a positive odd integer and q be a power of a prime. In this paper we give an explicit construction of a qâ€“regularâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 1995

Let k â‰¥ 1 be an odd integer, t = âŒŠ 4 âŒ‹ , and q be a prime power. We construct a bipartite, q-regular, edge-transitive graph CD(kâ€¦Â (More)

Is this relevant?

1983

1983

- J. Comb. Theory, Ser. B
- 1983

It is shown that a graph of large girth and minimum degree at least 3 share many properties with a graph of large minimum degreeâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- J. Comb. Theory, Ser. B
- 1977

All graph-theoretic concepts, which are not defined further, are taken from [6, 111. By graphs we mean nondirected graphs withoutâ€¦Â (More)

Is this relevant?