Twin-width one

DOI10.4230/LIPICS.STACS.2025.6MaRDI QIDQ7287736zbMATH OpenFDO

Authors Jung-Ho Ahn, H. Jacob, Noleen Köhler, Christophe Paul, Amadeus Reinald, Sebastian Wiederrecht

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey of the algorithmic aspects of modular decomposition
• Asteroidal Triple-Free Graphs
• Bounds for the twin-width of graphs
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
• Computing twin-width parameterized by the feedback edge number
• Deciding twin-width at most 4 is NP-complete
• Finding small patterns in permutations in linear time
• First-order logic and twin-width in tournaments
• Flip-width: cops and robber on dense graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1741000 (Why is no real title available?)
• Modular decomposition and transitive orientation
• Partially Ordered Sets
• Polynomial-time recognition of clique-width 3 graphs
• Sparse graphs of twin-width 2 have bounded tree-width
• The strong perfect graph theorem
• Transitiv orientierbare Graphen
• Twin-width and polynomial kernels
• Twin-width. I: Tractable FO model checking
• Twin-width. IV: Ordered graphs and matrices
• Twin-width. VI: The lens of contraction sequences

This page was built for publication: Twin-width one

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