Pages that link to "Item:Q5066940"
From MaRDI portal
The following pages link to Twin-width I: Tractable FO Model Checking (Q5066940):
Displaying 37 items.
- Twin-width and polynomial kernels (Q2093574) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Tree-width for first order formulae (Q2881100) (← links)
- Bounds for the Twin-Width of Graphs (Q5043639) (← links)
- Twin-width can be exponential in treewidth (Q6038574) (← links)
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Parity permutation pattern matching (Q6070786) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- A meta-theorem for distributed certification (Q6182681) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
- Twin-width and transductions of proper \(k\)-mixed-thin graphs (Q6552597) (← links)
- Parity permutation pattern matching (Q6586663) (← links)
- Hypergraphs with polynomial representation: introducing \(r\)-splits (Q6599817) (← links)
- On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (Q6611087) (← links)
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024 (Q6613409) (← links)
- Transducing paths in graph classes with unbounded shrubdepth (Q6614398) (← links)
- Planar graph with twin-width seven (Q6614402) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- Twin-width of random graphs (Q6641067) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
- Twin-width of graphs with tree-structured decompositions (Q6671382) (← links)
- Graph product structure for \(h\)-framed graphs (Q6671588) (← links)
