@inproceedings{8a8ff540209f477ab8490e5dc402fa33,

title = "Constructing tree decompositions of graphs with bounded gonality",

abstract = "In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related notions: stable divisorial gonality and stable gonality.",

author = "Bodlaender, {Hans L.} and {van Dobben de Bruyn}, Josse and Dion Gijswijt and Harry Smit",

note = "Accepted author manuscript; 26th International Conference on Computing and Combinatorics, COCOON 2020 ; Conference date: 29-08-2020 Through 31-08-2020",

year = "2020",

doi = "10.1007/978-3-030-58150-3_31",

language = "English",

isbn = "978-3-030-58149-7",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "384--396",

editor = "Donghyun Kim and R.N. Uma and Zhipeng Cai and Lee, {Dong Hoon}",

booktitle = "Computing and Combinatorics",

}