Donovan R. Hare

Orcid: 0000-0002-3426-4413

Affiliations:
  • University of British Columbia Okanagan, Kelowna, Canada


According to our database1, Donovan R. Hare authored at least 16 papers between 1989 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Tools for counting odd cycles in graphs.
J. Comb. Theory B, 2019

2013
The cluster deletion problem for cographs.
Discret. Math., 2013

The parametric complexity of graph diameter augmentation.
Discret. Appl. Math., 2013

2005
The set of values of b for which there exist block designs with b blocks.
Discret. Math., 2005

2001
Families of 4-Sets Without Property B.
Ars Comb., 2001

1999
Square critically 3-chromatic hypergraphs.
Discret. Math., 1999

1998
Color-critical graphs and hypergraphs with few edges and no short cycles.
Discret. Math., 1998

1997
Arithmetic Progressions in Sequences with Bounded Gaps.
J. Comb. Theory A, 1997

1996
Vertex transversals that dominate.
J. Graph Theory, 1996

1995
Cycles in the block-intersection graph of pairwise balanced designs.
Discret. Math., 1995

Large Faces in 4-Critical Planar Graphs with Minimum Degree 4.
Comb., 1995

1994
Sparse color-critical graphs and hypergraphs with no short cycles.
J. Graph Theory, 1994

1993
Sparsity Analysis of the $QR$ Factorization.
SIAM J. Matrix Anal. Appl., July, 1993

The Connectivity of the Block-Intersection Graphs of Designs.
Des. Codes Cryptogr., 1993

1991
Edge-pancyclic block-intersection graphs.
Discret. Math., 1991

1989
Sparse color-critical hypergraphs.
Comb., 1989


  Loading...