Scramble number and tree-cut decompositions
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality.In this paper we introduce the screewidth of a graph, based on a variation of the existing literature on tree-cut decompositions.We prove that this
Authors
- Lizzie Ferguson
- Cassandra Marcussen (ORCID: https://orcid.org/0009-0009-1335-6640)
- Liz Ostermeyer
- Eyobel Gebre
- Lisa Cenek
- Shefali Ramakrishna
- Ralph Morrison (ORCID: https://orcid.org/0000-0001-7134-1521)
- Jason Meintjes
- Ben Weber
Institutions
- Cornell University (US)
- Williams College (US)
- Harvard University Press (US)
- California University of Pennsylvania (US)
- University of Illinois Chicago (US)
- San Francisco State University (US)
Publication Details
- Journal
- The Art of Discrete and Applied Mathematics
- Published
- 2025-08-29
- DOI
- https://doi.org/10.26493/2590-9770.1792.fb4
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Williams College