The following pages link to Glenn H. Hurlbert (Q442314):
Displaying 50 items.
- (Q212913) (redirect page) (← links)
- (Q1741504) (redirect page) (← links)
- Pebbling in 2-paths (Q324757) (← links)
- \(t\)-pebbling and extensions (Q354409) (← links)
- General graph pebbling (Q385150) (← links)
- Generalizations of Graham's pebbling conjecture (Q442315) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- On the pebbling threshold of paths and the pebbling threshold spectrum (Q932604) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- On universal cycles for multisets (Q1044893) (← links)
- Research problems on Gray codes and universal cycles (Q1044897) (← links)
- A short proof that \(N^ 3\) is not a circle containment order (Q1115459) (← links)
- The antipodal layers problem (Q1322186) (← links)
- The dimension of interior levels of the Boolean lattice (Q1337570) (← links)
- Multicover Ucycles (Q1343787) (← links)
- Thresholds for families of multisets, with an application to graph pebbling (Q1402065) (← links)
- On pebbling threshold functions for graph sequences (Q1598791) (← links)
- A note on graph pebbling (Q1606023) (← links)
- Optimal pebbling number of graphs with given minimum degree (Q1741506) (← links)
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems (Q1744762) (← links)
- New constructions for De Bruijn tori (Q1894269) (← links)
- Equivalence class universal cycles for permutations (Q1910573) (← links)
- An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
- Erdős-Ko-Rado theorems on the weak Bruhat lattice (Q2026320) (← links)
- On intersecting families of independent sets in trees (Q2172383) (← links)
- 1-overlap cycles for Steiner triple systems (Q2249792) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Erdős-Ko-Rado theorems for chordal graphs and trees (Q2431248) (← links)
- On encodings of spanning trees (Q2462399) (← links)
- The cover pebbling number of graphs (Q2484366) (← links)
- On the existence of de Bruijn tori with two by two windows (Q2563712) (← links)
- Pebbling in powers of paths (Q2689489) (← links)
- Universal Cycles for Weak Orders (Q2870511) (← links)
- Gray codes and overlap cycles for restricted weight words (Q2931928) (← links)
- Pebbling in Split Graphs (Q2935280) (← links)
- s-Overlap Cycles for Permutations (Q2948802) (← links)
- Optimal Pebbling in Products of Graphs (Q3100997) (← links)
- On Pebbling Graphs by Their Blocks (Q3182875) (← links)
- On the Pebbling Threshold Spectrum (Q3438971) (← links)
- Near-Universal Cycles for Subsets Exist (Q3583316) (← links)
- (Q3635573) (← links)
- Linear Optimization (Q3639492) (← links)
- On Universal Cycles for <i>k</i>-Subsets of an <i>n</i>-Set (Q4317705) (← links)
- (Q4320815) (← links)
- Pebbling in diameter two graphs and products of paths (Q4344213) (← links)
- (Q4432941) (← links)
- (Q4489183) (← links)
- Pebbling on Graph Products and other Binary Graph Constructions (Q4616105) (← links)
- (Q4657465) (← links)
- (Q4949852) (← links)