### Table 4: Connected regular graphs with girth at least 5.

1999

Cited by 7

### Table 2: Best known bounds on the maximum number of edges in an D2-vertex graph with a given girth.

2001

"... In PAGE 9: ... Note, as mentioned above, that D1BECZB7BEB4D2B5 BP A2B4D1BECZB7BDB4D2B5B5. The best bounds on D1CVB4D2B5, for even girth CV, are given in Table2 . (Several references are given for each result.... In PAGE 9: ... 7. ACKNOWLEDGMENTS We would like to thank Edith Cohen for her results that inspired this research and for making the cooperation between the authors possible, Felix Lazebnik for his help in compiling Table2 , and Michael Elkin for pointing out the connection between distance or-... ..."

Cited by 108

### Table 2: Best known bounds on the maximum number of edges in an n-vertex graph with a given girth.

2001

"... In PAGE 20: ... More on this can be found in [TZ01]. Acknowledgment We would like to thank Edith Cohen for her results that inspired this research and for making the coop- eration between the authors possible, Felix Lazebnik for his help in compiling Table2 , and Michael Elkin for pointing out the connection between distance oracles and distance labels. References [ABCP99] B.... ..."

Cited by 108

### Table 5.2: Circular chromatic number of small cubic graphs of girth 9

### Table 5.5: Circular chromatic number of small cubic graphs of girth 6

### Table 5.6: Circular chromatic number of small cubic graphs of girth 8

### Table 2. Lower bound on independence ratio of all d-regular graphs with girth at least 2k + 3.

"... In PAGE 5: ...(d, p1, . . . , pk). Note that every choice of pi gives a lower bound on the independence ratio. Lower bounds on the function being maximised are given in Table2 for some specific values of k and d, obtained by setting pi = p for all i.... ..."

### TABLE II. BEST KNOWN BOUNDS ON THE MAXIMUM NUMBER OF EDGES IN AN n-VERTEX GRAPH WITH A GIVEN GIRTH

### Table 1: Generalized spoke vectors Girth Spoke vector

"... In PAGE 2: ... Corollary 1 follows easily by verifying the two conditions given in Proposition 1 for the new graph. Table1 provides some examples of these general spoke vectors for various girths. The results of applying Corollary 1 the spoke vectors given by Exoo in [16] are shown in Table 2.... ..."

### TABLE 2.1. Splitter theorems and generating theorems for 3-regular k-connected graphs with girth at least g.

2003