On the twin-width of outerplanar graphs

DOI10.1007/978-981-96-4445-2_9MaRDI QIDQ6909254zbMATH OpenFDO

Authors Muhammad Anwarul Azim, Sk Ruhul Azgor, Sadia Sharmin, Md. Saidur Rahman

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_9

zbMATH Keywords

fixed-parameter tractableouterplanar graphstwin-width

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• A SAT approach to twin-width
• Basic graph theory
• Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
• Complement reducible graphs
• Deciding twin-width at most 4 is NP-complete
• Graph minors. II. Algorithmic aspects of tree-width
• Graph product structure for h-framed graphs
• Planar graph with twin-width seven
• Planar graphs have bounded queue-number
• Queue layouts of planar 3-trees
• Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar
• Twin-width. I: Tractable FO model checking
• Twin-width. II: Small classes
• Twin-width. VI: The lens of contraction sequences

This page was built for publication: On the twin-width of outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909254)