Glenn H. Hurlbert

Orcid: 0000-0003-2906-7770

Affiliations:
  • Arizona State University, Tempe, Arizona, USA


According to our database1, Glenn H. Hurlbert authored at least 45 papers between 1993 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Holroyd-Talbot conjecture for sparse graphs.
Discret. Math., January, 2024

Pebbling in Kneser Graphs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Pebbling in powers of paths.
Discret. Math., May, 2023

Cops and robbers pebbling in graphs.
CoRR, 2023

2022
On intersecting families of independent sets in trees.
Discret. Appl. Math., 2022

2020
An Erdős-Ko-Rado theorem for unions of length 2 paths.
Discret. Math., 2020

2019
Erdős-Ko-Rado theorems on the weak Bruhat lattice.
Discret. Appl. Math., 2019

Optimal pebbling number of graphs with given minimum degree.
Discret. Appl. Math., 2019

2018
New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems.
Discret. Math., 2018

2017
The Weight Function Lemma for graph pebbling.
J. Comb. Optim., 2017

Pebbling in semi-2-trees.
Discret. Math., 2017

2015
Pebbling in 2-Paths.
Electron. Notes Discret. Math., 2015

2014
Pebbling in Split Graphs.
SIAM J. Discret. Math., 2014

Gray codes and overlap cycles for restricted weight words.
Discret. Math. Algorithms Appl., 2014

1-Overlap cycles for Steiner triple systems.
Des. Codes Cryptogr., 2014

2013
Universal Cycles for Weak Orders.
SIAM J. Discret. Math., 2013

t-Pebbling and Extensions.
Graphs Comb., 2013

General graph pebbling.
Discret. Appl. Math., 2013

2012
Generalizations of Graham's pebbling conjecture.
Discret. Math., 2012

2011
Erdos-Ko-Rado theorems for chordal graphs and trees.
J. Comb. Theory, Ser. A, 2011

Optimal pebbling in products of graphs.
Australas. J Comb., 2011

2009
Near-Universal Cycles for Subsets Exist.
SIAM J. Discret. Math., 2009

Preface.
Discret. Math., 2009

Research problems on Gray codes and universal cycles.
Discret. Math., 2009

On universal cycles for multisets.
Discret. Math., 2009

2008
On the pebbling threshold of paths and the pebbling threshold spectrum.
Discret. Math., 2008

The pebbling threshold of the square of cliques.
Discret. Math., 2008

2007
On encodings of spanning trees.
Discret. Appl. Math., 2007

2006
Girth, Pebbling, and Grid Thresholds.
SIAM J. Discret. Math., 2006

2005
The cover pebbling number of graphs.
Discret. Math., 2005

2003
Thresholds for families of multisets, with an application to graph pebbling.
Discret. Math., 2003

Pebbling in dense graphs.
Australas. J Comb., 2003

2002
A Note on Graph Pebbling.
Graphs Comb., 2002

On pebbling threshold functions for graph sequences.
Discret. Math., 2002

2001
On the Pebbling Threshold Spectrum.
Electron. Notes Discret. Math., 2001

Spanning Trees of Bounded Degree.
Electron. J. Comb., 2001

1997
Pebbling in diameter two graphs and products of paths.
J. Graph Theory, 1997

On Higher Dimensional Perfect Factors.
Ars Comb., 1997

1996
On the Existence of de Bruijn Tori with Two by Two Windows.
J. Comb. Theory, Ser. A, 1996

Equivalence class universal cycles for permutations.
Discret. Math., 1996

1995
Multicover Ucycles.
Discret. Math., 1995

New Constructions for De Bruijn Tori.
Des. Codes Cryptogr., 1995

1994
On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set.
SIAM J. Discret. Math., 1994

The antipodal layers problem.
Discret. Math., 1994

1993
On the de Bruijn Torus Problem.
J. Comb. Theory, Ser. A, 1993


  Loading...