Geoffrey Exoo

Tom Raiman

J. Comb. Optim., November, 2023

2020

The Chromatic Number of the Plane is At Least 5: A New Proof.

[BibT_eX]

[DOI]

Dan Ismailescu

Discret. Comput. Geom., 2020

2019

On the defect of vertex-transitive graphs of given degree and diameter.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Bounds for the smallest k-chromatic graphs of given girth.

[BibT_eX]

[DOI]

Jan Goedgebeur

Discret. Math. Theor. Comput. Sci., 2019

2016

Biregular Cages of Odd Girth.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Small bi-regular graphs of even girth.

[BibT_eX]

[DOI]

Gabriela Araujo-Pardo

Discret. Math., 2016

2015

New Lower Bounds for 28 Classical Ramsey Numbers.

[BibT_eX]

[DOI]

Milos Tatarevic

Electron. J. Comb., 2015

2014

On the Chromatic Number of ℝ4.

[BibT_eX]

[DOI]

Dan Ismailescu

Michael Lim

Discret. Comput. Geom., 2014

2013

On Some Small Classical Ramsey Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Recursive constructions of small regular graphs of given degree and girth.

[BibT_eX]

[DOI]

Discret. Math., 2012

Radial Moore graphs of radius three.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On the Ramsey Number R(4, 6).

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Computational determination of (3, 11) and (4, 7) cages.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

On the girth of voltage graph lifts.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Locating-dominating codes in paths.

[BibT_eX]

[DOI]

Ville Junnila

Discret. Math., 2011

Locating-dominating codes in cycles.

[BibT_eX]

[DOI]

Ville Junnila

Australas. J Comb., 2011

2010

Ranking measures for radially Moore graphs.

[BibT_eX]

[DOI]

Networks, 2010

Improved bounds on identifying codes in binary Hamming spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

On the limitations of the use of solvable groups in Cayley graph cage constructions.

[BibT_eX]

[DOI]

Marston D. E. Conder

Eur. J. Comb., 2010

2009

Properties of Groups for the Cage and Degree/Diameter Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Upper bounds for binary identifying codes.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

New bounds on binary identifying codes.

[BibT_eX]

[DOI]

Sanna M. Ranto

Discret. Appl. Math., 2008

Improved bounds on binary identifying codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Improved Upper Bounds on Binary Identifying Codes.

[BibT_eX]

[DOI]

Sanna M. Ranto

IEEE Trans. Inf. Theory, 2007

Improved Identifying Codes in F2n.

[BibT_eX]

[DOI]

Sanna M. Ranto

Proceedings of the IEEE International Symposium on Information Theory, 2007

2005

epsilon-Unit Distance Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

2004

Some applications of pq-groups in graph theory.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.

[BibT_eX]

[DOI]

Xiaodong Xu

Xie Zheng

Stanislaw P. Radziszowski

Electron. J. Comb., 2004

Voltage Graphs, Group Presentations and Cages.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2003

A Euclidean Ramsey Problem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

2002

Totally magic graphs.

[BibT_eX]

[DOI]

Alan C. H. Ling

John P. McSorley

Nicholas C. K. Phillips

Walter D. Wallis

Discret. Math., 2002

A Small Trivalent Graph of Girth 14.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

A family of graphs and the degree/diameter problem.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

A trivalent graph of girth 17.

[BibT_eX]

[DOI]

Australas. J Comb., 2001

1998

Some New Ramsey Colorings.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

1996

A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

1994

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 1994

1992

On set systems not containing delta systems.

[BibT_eX]

[DOI]

H. L. Abbott

Graphs Comb., 1992

1991

A bipartite Ramsey number.

[BibT_eX]

[DOI]

Graphs Comb., 1991

Three color Ramsey number of K4-e.

[BibT_eX]

[DOI]

Discret. Math., 1991

1989

On Two Classical Ramsey Numbers of the Form R(3, n).

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

A lower bound for r(5, 5).

[BibT_eX]

[DOI]

J. Graph Theory, 1989

The ramsey number of k5 - e.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

1988

Ramsey numbers based on C5-decompositions.

[BibT_eX]

[DOI]

Donald F. Reynolds

Discret. Math., 1988

1983

On line disjoint paths of bounded length.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

On a measure of communication network vulnerability.

[BibT_eX]

[DOI]

Networks, 1982

A counterexample to a conjecture on paths of bounded length.

[BibT_eX]

[DOI]

Stephanie M. Boyles

J. Graph Theory, 1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graph.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

Covering and packing in graphs IV: Linear arboricity.

[BibT_eX]

[DOI]

Jin Akiyama

Frank Harary

Networks, 1981

On an adjacency property of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

Paley graphs satisfy all first-order adjacency axioms.

[BibT_eX]

[DOI]

Andreas Blass

Frank Harary

J. Graph Theory, 1981

Further results on graph equations for line graphs and n-th power graphs.

[BibT_eX]

[DOI]

Jin Akiyama

Hiroshi Era

Discret. Math., 1981

1980

The smallest graphs with certain adjacency properties.

[BibT_eX]

[DOI]