Treewidth is a lower bound on graph gonality

From MaRDI portal
Revision as of 01:36, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2200865

DOI10.5802/ALCO.124zbMath1477.05125arXiv1407.7055OpenAlexW3081225756MaRDI QIDQ2200865

Josse van Dobben de Bruyn, Dion C. Gijswijt

Publication date: 23 September 2020

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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






Related Items (18)




Cites Work




This page was built for publication: Treewidth is a lower bound on graph gonality