The following pages link to On the scramble number of graphs (Q2074355):
Displaying 9 items.
- Fast scramblers, horizons and expander graphs (Q1795837) (← links)
- Computing graph gonality is hard (Q2004086) (← links)
- A new lower bound on graph gonality (Q2065783) (← links)
- Discrete and metric divisorial gonality can be different (Q2120835) (← links)
- (Q3013511) (← links)
- Scrambled sets and chain recurrence points of generic graph maps (Q5870249) (← links)
- Multiplicity-free gonality on graphs (Q6090311) (← links)
- Graphs of scramble number two (Q6172289) (← links)
- The gonality of queen's graphs (Q6611735) (← links)