Twin-width of graphs on surfaces
From MaRDI portal
Cites work
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- An improved planar graph product structure theorem
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
- Bounds for the twin-width of graphs
- Bounds on the Twin-Width of Product Graphs
- Compact representation for matrices of bounded twin-width
- Deciding first-order properties for sparse graphs
- Deciding first-order properties of locally tree-decomposable structures
- Deciding twin-width at most 4 is NP-complete
- Graph product structure for h-framed graphs
- Graphs of bounded twin-width are quasi-polynomially -bounded
- Graphs on surfaces
- scientific article; zbMATH DE number 3698053 (Why is no real title available?)
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 1256757 (Why is no real title available?)
- scientific article; zbMATH DE number 1405654 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- Improved product structure for graphs on surfaces
- Layered separators in minor-closed graph classes with applications
- Linear time solvable optimization problems on graphs of bounded clique-width
- Notes on graph product structure theory
- Planar graph with twin-width seven
- Planar graphs have bounded nonrepetitive chromatic number
- Planar graphs have bounded queue-number
- Planar graphs have bounded queue-number
- Stable graphs of bounded twin-width
- Testing first-order properties for subclasses of sparse graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-width and generalized coloring numbers
- Twin-width and permutations (extended abstract)
- Twin-width and polynomial kernels
- Twin-width IV: ordered graphs and matrices
- Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar
- Twin-width of planar graphs; a short proof (extended abstract)
- Twin-width V: linear minors, modular counting, and matrix multiplication
- Twin-width. I: Tractable FO model checking
- Twin-width. I: Tractable FO model checking
- Twin-width. II: Small classes
- Twin-width. VI: The lens of contraction sequences
- Twin-width. VIII: Delineation and win-wins
This page was built for publication: Twin-width of graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241074)
