Twin-width. II: Small classes

DOI10.5555/3458064.3458182MaRDI QIDQ6147374zbMATH OpenFDO

Authors Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458182

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Twin-width II: small classes
• Twin-width. I: Tractable FO model checking
• Twin-width IV: ordered graphs and matrices

Cited in

(22)

• Sparse graphs of twin-width 2 have bounded tree-width
• Twin-width. VIII: Delineation and win-wins
• The widths of strict outerconfluent graphs
• Structural properties of graph products
• Twin-width and permutations (extended abstract)
• Twin-width of graphs on surfaces
• Twin-width. III: Max independent set, min dominating set, and coloring
• Twin-width. IV: Ordered graphs and matrices
• Planar graph with twin-width seven
• Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings
• \(\mathcal{H}\)-clique-width and a hereditary analogue of product structure
• Twin-width. III: Max independent set, min dominating set, and coloring
• Twin-width meets feedback edges and vertex integrity
• Stable graphs of bounded twin-width
• Isomorphism for tournaments of small twin width
• Computing and certifying twin-width using logic
• Advances in algorithmic meta theorems (invited paper)
• Computing twin-width parameterized by the feedback edge number
• Twin-width of graphs with tree-structured decompositions
• On the twin-width of outerplanar graphs
• Twin-width of planar graphs is at most 8, and some related bounds
• Twin-width and transductions of proper \(k\)-mixed-thin graphs

This page was built for publication: Twin-width. II: Small classes

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