#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1980

2016

- This year (0)
- Last five years (8)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jin Akiyama, Geoffrey Exoo, Frank Harary
- Networks
- 1981

A (k, g)-cage is a k-regular graph of girth g of minimum order. In this survey, we present the results of over 50 years of searches for cages. We present the important theorems, list all the known cages, compile tables of current record holders, and describe in some detail most of the relevant constructions.

- Xiaodong Xu, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski
- Electr. J. Comb.
- 2004

This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results, and then by presenting several general constructions establishing new lower bounds for many diagonal and off-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for

- Geoffrey Exoo
- Journal of Graph Theory
- 1989

- Geoffrey Exoo
- Journal of Graph Theory
- 1981

- Geoffrey Exoo
- Electr. J. Comb.
- 2004

We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations.

- Geoffrey Exoo, Dan Ismailescu, Michael Lim
- Discrete & Computational Geometry
- 2014

- Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis
- Discrete Mathematics
- 2002

A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, · · · , v +e. Such a labeling is vertex magic if the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex, and edge magic if the sum of an edge label and… (More)

- Geoffrey Exoo
- Discrete & Computational Geometry
- 2003