Glenn Hurlbert - Publications

Affiliations: 
Arizona State University, Tempe, AZ, United States 
Area:
Mathematics

27 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Feghali C, Hurlbert G, Kamat V. An Erdős–Ko–Rado theorem for unions of length 2 paths Discrete Mathematics. 343: 112121. DOI: 10.1016/J.Disc.2020.112121  0.693
2019 Czygrinow A, Hurlbert G, Katona GY, Papp LF. Optimal pebbling number of graphs with given minimum degree Discrete Applied Mathematics. 260: 117-130. DOI: 10.1016/J.Dam.2019.01.023  0.484
2019 Fishel S, Hurlbert G, Kamat V, Meagher K. Erdős–Ko–Rado theorems on the weak Bruhat lattice Discrete Applied Mathematics. 266: 65-75. DOI: 10.1016/J.Dam.2018.12.019  0.357
2017 Alcn L, Gutierrez M, Hurlbert G. Pebbling in semi-2-trees Discrete Mathematics. 340: 1467-1480. DOI: 10.1016/J.Disc.2017.02.011  0.488
2016 Hurlbert G. The Weight Function Lemma for graph pebbling Journal of Combinatorial Optimization. 1-19. DOI: 10.1007/S10878-016-9993-Z  0.509
2015 Alcón L, Gutierrez M, Hurlbert G. Pebbling in 2-Paths Electronic Notes in Discrete Mathematics. 50: 145-150. DOI: 10.1016/J.Endm.2015.07.025  0.495
2014 Alcón L, Gutierrez M, Hurlbert G. Pebbling in split graphs Siam Journal On Discrete Mathematics. 28: 1449-1466. DOI: 10.1137/130914607  0.399
2014 Horan V, Hurlbert G. 1-Overlap cycles for Steiner triple systems Designs, Codes, and Cryptography. 72: 637-651. DOI: 10.1007/S10623-013-9802-Y  0.726
2013 Horan V, Hurlbert G. Universal cycles for weak orders Siam Journal On Discrete Mathematics. 27: 1360-1371. DOI: 10.1137/120886807  0.716
2013 Hurlbert G. General graph pebbling Discrete Applied Mathematics. 161: 1221-1231. DOI: 10.1016/J.Dam.2012.03.010  0.465
2013 Herscovici DS, Hester BD, Hurlbert GH. t-Pebbling and Extensions Graphs and Combinatorics. 29: 955-975. DOI: 10.1007/s00373-012-1152-4  0.35
2013 Horan V, Hurlbert G. Overlap Cycles for Steiner Quadruple Systems Journal of Combinatorial Designs. DOI: 10.1002/Jcd.21378  0.715
2012 Herscovici DS, Hester BD, Hurlbert GH. Generalizations of Graham's pebbling conjecture Discrete Mathematics. 312: 2286-2293. DOI: 10.1016/j.disc.2012.03.032  0.394
2011 Hurlbert G, Kamat V. Erddouble acutess-Ko-Rado theorems for chordal graphs and trees Journal of Combinatorial Theory. Series A. 118: 829-841. DOI: 10.1016/J.Jcta.2010.11.017  0.704
2009 Curtis D, Hines T, Hurlbert G, Moyer T. On Pebbling Graphs by Their Blocks Integers. 9: 411-422. DOI: 10.1515/Integ.2009.033  0.449
2009 Jackson B, Stevens B, Hurlbert G. Research problems on Gray codes and universal cycles Discrete Mathematics. 309: 5341-5348. DOI: 10.1016/J.Disc.2009.04.002  0.355
2008 Bekmetjev A, Hurlbert G. The pebbling threshold of the square of cliques Discrete Mathematics. 308: 4306-4314. DOI: 10.1016/J.Disc.2007.08.012  0.763
2008 Czygrinow A, Hurlbert GH. On the pebbling threshold of paths and the pebbling threshold spectrum Discrete Mathematics. 308: 3297-3307. DOI: 10.1016/J.Disc.2007.06.045  0.372
2007 Hurlbert GH. On encodings of spanning trees Discrete Applied Mathematics. 155: 2594-2600. DOI: 10.1016/j.dam.2007.07.014  0.393
2006 Czygrinow A, Hurlbert G. Girth, pebbling, and grid thresholds Siam Journal On Discrete Mathematics. 20: 1-10. DOI: 10.1137/S0895480102416374  0.487
2005 Crull B, Cundiff T, Feltman P, Hurlbert GH, Pudwell L, Szaniszlo Z, Tuza Z. The cover pebbling number of graphs Discrete Mathematics. 296: 15-23. DOI: 10.1016/j.disc.2005.03.009  0.407
2003 Bekmetjev A, Brightwell G, Czygrinow A, Hurlbert G. Thresholds for families of multisets, with an application to graph pebbling Discrete Mathematics. 269: 21-34. DOI: 10.1016/S0012-365X(02)00745-8  0.766
2003 Czygrinow A, Hurlbert G. Pebbling in dense graphs Australasian Journal of Combinatorics. 28: 201-208.  0.415
2002 Czygrinow A, Hurlbert G, Kierstead HA, Trotter WT. A note on graph pebbling Graphs and Combinatorics. 18: 219-225. DOI: 10.1007/S003730200015  0.364
2001 Czygrinow A, Fan G, Hurlbert G, Kierstead HA, Trotter WT. Spanning trees of bounded degree Electronic Journal of Combinatorics. 8: 1-12. DOI: 10.37236/1577  0.406
1997 Clarke TA, Hochberg RA, Hurlbert GH. Pebbling in Diameter Two Graphs and Products of Paths Journal of Graph Theory. 25: 119-128.  0.385
1996 Hurlbert G, Isaak G. Equivalence class universal cycles for permutations Discrete Mathematics. 149: 123-129. DOI: 10.1016/0012-365X(94)00314-9  0.385
Show low-probability matches.