Bounding the Treewidth of Outer \(k\)-Planar Graphs via Triangulations
Bounding the Treewidth of Outer \(k\)-Planar Graphs via Triangulations
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer \(k\)-planar graphs, that is, graphs that admit a straight-line drawing where all the vertices lie on a circle, and every edge is cross...
Alternative Titles
Full title
Bounding the Treewidth of Outer \(k\)-Planar Graphs via Triangulations
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_3091014908
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_3091014908
Other Identifiers
E-ISSN
2331-8422
