### 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: 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 II. BEST KNOWN BOUNDS ON THE MAXIMUM NUMBER OF EDGES IN AN n-VERTEX GRAPH WITH A GIVEN GIRTH

### Table 2: Graph classes with circular model.

"... In PAGE 12: ...lasses with the same approach (cf. Table 1). The graph classes of Table 1 have natural generalizations (in the way circu- lar permutation graphs generalize permutation graphs) by somehow transforming the linear intersection model into a `circular apos; one. The corresponding classes are given in Table2 and we propose to call them graph classes with circular model. The last three of these are new graph classes.... In PAGE 12: ... Thereby two parallel lines of the generalized trapezoid are arcs of each of the two circles and the two other lines of the generalized trapezoid are spiral segments. Any of the problems considered in this paper can be solved in polynomial time for the graph classes of Table2 by reducing the problem on a given graph to the same problem on a `reasonable small apos; collection of induced subgraphs belonging... ..."

### 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 3: Relations among inductivity, clique number, and chromatic number of the interference graph.

"... In PAGE 13: ... radii FIRST-FIT STRIP SL RD DD LG arbitrary 5 5 N/A N/A N/A uniform 3 5 3 3 3 We also obtain relations among the inductivity, the clique number, and the chromatic number of the interference graph. Table3 summarizes the upper bounds on the pairwise ratios of these parameters. Table 3: Relations among inductivity, clique number, and chromatic number of the interference graph.... ..."

### Table 1. A new exact algorithm for the computation of the chromatic number of a graph G.

"... In PAGE 3: ...- 3 - A description of the new exact algorithm is given in Table1 . We have used the following notations.... ..."