Constructing tree decompositions of graphs with bounded gonality
Keyword(s):
AbstractIn 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.
Keyword(s):
Keyword(s):
2000 ◽
Vol 11
(03)
◽
pp. 365-371
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol 61
(1)
◽
pp. 51-78
◽
2002 ◽
Vol 50
(8)
◽
pp. 1935-1941
◽