Deciding twin-width at most 4 is NP-complete

DOI10.4230/LIPICS.ICALP.2022.18MaRDI QIDQ6560802

Pierre Bergé, Hugues Déprés, Édouard Bonnet

Publication date: 24 June 2024

zbMATH Keywords

lower boundstwin-width

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Twin-width and transductions of proper \(k\)-mixed-thin graphs ⋮ Planar graph with twin-width seven ⋮ Twin-width of graphs with tree-structured decompositions

This page was built for publication: Deciding twin-width at most 4 is NP-complete

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