Constructing tree decompositions of graphs with bounded gonality

Hans L. Bodlaender (), Josse Dobben de Bruyn (), Dion Gijswijt () and Harry Smit ()
Additional contact information
Hans L. Bodlaender: Utrecht University
Josse Dobben de Bruyn: Delft University of Technology
Dion Gijswijt: Delft University of Technology
Harry Smit: Max Planck Institute for Mathematics

Journal of Combinatorial Optimization, 2022, vol. 44, issue 4, No 28, 2699 pages

Abstract: 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.

Keywords: Tree decomposition; Gonality; Chip firing (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00762-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00762-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00762-w

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().