Constructing Tree Decompositions of Graphs with Bounded Gonality
Discrete Mathematics
2020-05-13 v1 Combinatorics
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 , when an effective divisor of degree that reaches all vertices is given. We also give a similar result for two related notions: stable divisorial gonality and stable gonality.
Cite
@article{arxiv.2005.05569,
title = {Constructing Tree Decompositions of Graphs with Bounded Gonality},
author = {Hans L. Bodlaender and Josse van Dobben de Bruyn and Dion Gijswijt and Harry Smit},
journal= {arXiv preprint arXiv:2005.05569},
year = {2020}
}
Comments
18 pages, 3 figures