Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Knot diagrams of treewidth two

From MaRDI portal
Publication:2110609
Jump to:navigation, search

DOI10.1007/978-3-030-60440-0_7OpenAlexW3033779124MaRDI QIDQ2110609

Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev, Hans L. Bodlaender

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/1904.03117


zbMATH Keywords

treewidthgraph algorithmsknot theoryseries parallel graphsknot diagrams


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width






This page was built for publication: Knot diagrams of treewidth two

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2110609&oldid=14613401"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki