Graphs of scramble number two

DOI10.1016/J.DISC.2023.113539zbMath1518.05136arXiv2212.09949MaRDI QIDQ6172289

Robin Eagleton, Ralph Morrison

Publication date: 19 July 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.09949

zbMATH Keywords

topological minorsscramble numbergraph gonality

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Computing graph gonality is hard
• A new lower bound on graph gonality
• On the scramble number of graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• A Reduction Method for Edge-Connectivity in Graphs
• Finding topological subgraphs is fixed-parameter tractable

This page was built for publication: Graphs of scramble number two