First order logic on pathwidth revisited again
From MaRDI portal
Cites work
- A note on first-fit coloring of interval graphs
- Algorithmic meta-theorems for restrictions of treewidth
- Deciding first-order properties of locally tree-decomposable structures
- Elementary first-order model checking for sparse graphs
- Elements of finite model theory.
- Expanding the expressive power of monadic second-order logic on restricted graph classes
- Fine-grained meta-theorems for vertex integrity
- FO model checking on posets of bounded width
- Generalized model-checking over locally tree-decomposable classes
- Grundy Distinguishes Treewidth from Pathwidth
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- Kernelizing MSO properties of trees of fixed height, and some consequences
- Linear time solvable optimization problems on graphs of bounded clique-width
- Meta-kernelization using well-structured modulators
- Meta-kernelization with structural parameters
- Model checking lower bounds for simple graphs
- Monadic second order logic on graphs with local cardinality constraints
- Parameterized algorithms
- Parameterized complexity of fair vertex evaluation problems
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Testing first-order properties for subclasses of sparse graphs
- The complexity of first-order and monadic second-order logic revisited
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-width. I: Tractable FO model checking
This page was built for publication: First order logic on pathwidth revisited again
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308604)
