The following pages link to Daniel Gray (Q306193):
Displaying 17 items.
- Note on superpatterns (Q306194) (← links)
- (Q724862) (redirect page) (← links)
- A variant of Nim (Q724864) (← links)
- Patterns in colored circular permutations (Q1639631) (← links)
- Combinatorics of \(n\)-color cyclic compositions (Q1783638) (← links)
- Trees with the mos subtrees - an algorithmic approach (Q1937356) (← links)
- Some extremal problems for trinomials with fold symmetry (Q2144418) (← links)
- On the combinatorics of derangements and related permutations (Q2152733) (← links)
- On majorization of closed walk vectors of trees with given degree sequences (Q2335614) (← links)
- Bounds on superpatterns containing all layered permutations (Q2354608) (← links)
- (Q3581876) (← links)
- (Q4683281) (← links)
- (Q5088677) (← links)
- The Number of Subtrees of Trees with Given Degree Sequence (Q5325940) (← links)
- (Q5383238) (← links)
- On the Koebe quarter theorem for trinomials with fold symmetry (Q6052134) (← links)
- An extremal problem for odd univalent polynomials (Q6201001) (← links)