Pages that link to "Item:Q5066940"
From MaRDI portal
The following pages link to Twin-width I: Tractable FO Model Checking (Q5066940):
Displaying 18 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)
- 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)
- 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)
