default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGlenn H. Hurlbert
Person information
- affiliation: Arizona State University, Tempe, Arizona, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Peter Frankl, Glenn Hurlbert
:
On the Holroyd-Talbot conjecture for sparse graphs. Discret. Math. 347(1): 113742 (2024)- [j43]Paul Fay, Glenn Hurlbert, Maya Tennant:
Cup stacking in graphs. Discret. Math. 347(9): 114097 (2024) - [c1]Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki:
Pebbling in Kneser Graphs. LATIN (2) 2024: 46-60 - 2023
- [j42]Liliana Alcón, Glenn Hurlbert:
Pebbling in powers of paths. Discret. Math. 346(5): 113315 (2023) - [i5]Joshua Forkin, Glenn Hurlbert:
Cops and robbers pebbling in graphs. CoRR abs/2301.00434 (2023) - 2022
- [j41]Glenn Hurlbert, Vikram Kamat:
On intersecting families of independent sets in trees. Discret. Appl. Math. 321: 4-9 (2022) - 2020
- [j40]Carl Feghali, Glenn Hurlbert, Vikram Kamat:
An Erdős-Ko-Rado theorem for unions of length 2 paths. Discret. Math. 343(12): 112121 (2020)
2010 – 2019
- 2019
- [j39]Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp:
Optimal pebbling number of graphs with given minimum degree. Discret. Appl. Math. 260: 117-130 (2019) - [j38]Susanna Fishel, Glenn Hurlbert, Vikram Kamat, Karen Meagher:
Erdős-Ko-Rado theorems on the weak Bruhat lattice. Discret. Appl. Math. 266: 65-75 (2019) - 2018
- [j37]Glenn Hurlbert, Vikram Kamat:
New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems. Discret. Math. 341(6): 1749-1754 (2018) - 2017
- [j36]Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert:
Pebbling in semi-2-trees. Discret. Math. 340(7): 1467-1480 (2017) - [j35]Glenn Hurlbert:
The Weight Function Lemma for graph pebbling. J. Comb. Optim. 34(2): 343-361 (2017) - 2015
- [j34]Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert:
Pebbling in 2-Paths. Electron. Notes Discret. Math. 50: 145-150 (2015) - 2014
- [j33]Victoria Horan, Glenn Hurlbert:
1-Overlap cycles for Steiner triple systems. Des. Codes Cryptogr. 72(3): 637-651 (2014) - [j32]Victoria Horan, Glenn H. Hurlbert:
Gray codes and overlap cycles for restricted weight words. Discret. Math. Algorithms Appl. 6(4) (2014) - [j31]Liliana Alcón, Marisa Gutierrez, Glenn H. Hurlbert:
Pebbling in Split Graphs. SIAM J. Discret. Math. 28(3): 1449-1466 (2014) - [i4]Victoria Horan, Glenn Hurlbert:
Gray Codes and Overlap Cycles for Restricted Weight Words. CoRR abs/1403.1818 (2014) - 2013
- [j30]Glenn Hurlbert:
General graph pebbling. Discret. Appl. Math. 161(9): 1221-1231 (2013) - [j29]David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
t-Pebbling and Extensions. Graphs Comb. 29(4): 955-975 (2013) - [j28]Victoria Horan, Glenn Hurlbert:
Universal Cycles for Weak Orders. SIAM J. Discret. Math. 27(3): 1360-1371 (2013) - 2012
- [j27]David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
Generalizations of Graham's pebbling conjecture. Discret. Math. 312(15): 2286-2293 (2012) - [i3]Victoria Horan, Glenn Hurlbert:
Universal Cycles for Weak Orders. CoRR abs/1203.5169 (2012) - [i2]Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert:
Pebbling in Split Graphs. CoRR abs/1211.4049 (2012) - 2011
- [j26]David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
Optimal pebbling in products of graphs. Australas. J Comb. 50: 3-24 (2011) - [j25]Glenn Hurlbert, Vikram Kamat:
Erdos-Ko-Rado theorems for chordal graphs and trees. J. Comb. Theory A 118(3): 829-841 (2011)
2000 – 2009
- 2009
- [j24]Brett Stevens, Glenn Hurlbert, Bradley Jackson:
Preface. Discret. Math. 309(17): 5255-5258 (2009) - [j23]Glenn Hurlbert, Tobias Johnson, Joshua Zahl:
On universal cycles for multisets. Discret. Math. 309(17): 5321-5327 (2009) - [j22]Brad Jackson, Brett Stevens, Glenn Hurlbert:
Research problems on Gray codes and universal cycles. Discret. Math. 309(17): 5341-5348 (2009) - [j21]Dawn Curtis, Taylor Hines, Glenn Hurlbert, Tatiana Moyer:
Near-Universal Cycles for Subsets Exist. SIAM J. Discret. Math. 23(3): 1441-1449 (2009) - [i1]David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
t-Pebbling and Extensions. CoRR abs/0905.3949 (2009) - 2008
- [j20]Andrzej Czygrinow, Glenn H. Hurlbert:
On the pebbling threshold of paths and the pebbling threshold spectrum. Discret. Math. 308(15): 3297-3307 (2008) - [j19]Airat Bekmetjev, Glenn Hurlbert:
The pebbling threshold of the square of cliques. Discret. Math. 308(19): 4306-4314 (2008) - 2007
- [j18]Glenn H. Hurlbert:
On encodings of spanning trees. Discret. Appl. Math. 155(18): 2594-2600 (2007) - 2006
- [j17]Andrzej Czygrinow, Glenn Hurlbert:
Girth, Pebbling, and Grid Thresholds. SIAM J. Discret. Math. 20(1): 1-10 (2006) - 2005
- [j16]Betsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszló, Zsolt Tuza:
The cover pebbling number of graphs. Discret. Math. 296(1): 15-23 (2005) - 2003
- [j15]Andrzej Czygrinow, Glenn Hurlbert:
Pebbling in dense graphs. Australas. J Comb. 28: 201-208 (2003) - [j14]Airat Bekmetjev, Graham R. Brightwell, Andrzej Czygrinow, Glenn Hurlbert:
Thresholds for families of multisets, with an application to graph pebbling. Discret. Math. 269(1-3): 21-34 (2003) - 2002
- [j13]Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll:
On pebbling threshold functions for graph sequences. Discret. Math. 247(1-3): 93-105 (2002) - [j12]Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter:
A Note on Graph Pebbling. Graphs Comb. 18(2): 219-225 (2002) - 2001
- [j11]Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. Electron. J. Comb. 8(1) (2001) - [j10]Glenn Hurlbert:
On the Pebbling Threshold Spectrum. Electron. Notes Discret. Math. 10: 146-150 (2001)
1990 – 1999
- 1997
- [j9]Glenn Hurlbert, Garth Isaak:
On Higher Dimensional Perfect Factors. Ars Comb. 45 (1997) - [j8]T. A. Clarke, Robert A. Hochberg, Glenn H. Hurlbert:
Pebbling in diameter two graphs and products of paths. J. Graph Theory 25(2): 119-128 (1997) - 1996
- [j7]Glenn Hurlbert, Garth Isaak:
Equivalence class universal cycles for permutations. Discret. Math. 149(1-3): 123-129 (1996) - [j6]Glenn Hurlbert, Chris J. Mitchell, Kenneth G. Paterson:
On the Existence of de Bruijn Tori with Two by Two Windows. J. Comb. Theory A 76(2): 213-230 (1996) - 1995
- [j5]Glenn Hurlbert, Garth Isaak:
New Constructions for De Bruijn Tori. Des. Codes Cryptogr. 6(1): 47-56 (1995) - [j4]Glenn Hurlbert:
Multicover Ucycles. Discret. Math. 137(1-3): 241-249 (1995) - 1994
- [j3]Glenn Hurlbert:
The antipodal layers problem. Discret. Math. 128(1-3): 237-245 (1994) - [j2]Glenn Hurlbert:
On Universal Cycles for k-Subsets of an n-Set. SIAM J. Discret. Math. 7(4): 598-604 (1994) - 1993
- [j1]Glenn Hurlbert, Garth Isaak:
On the de Bruijn Torus Problem. J. Comb. Theory A 64(1): 50-62 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
