scientific article; zbMATH DE number 7376053
From MaRDI portal
Publication:5002812
DOI10.4230/LIPIcs.ICALP.2018.126zbMath1499.68202MaRDI QIDQ5002812
Stephan Kreutzer, Patrice Ossona de Mendez, Szymon Toruńczyk, Jakub Gajarský, Sebastian Siebertz, Michał Pilipczuk, Jaroslav Nešetřil
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Structural characterization of families of graphs (05C75)
Related Items (5)
In praise of homomorphisms ⋮ Regular partitions of gentle graphs ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ On low rank-width colorings ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bi-complement reducible graphs
- FO model checking on map graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Grad and classes with bounded expansion. I: Decompositions
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Fixed-Parameter Tractability, Definability, and Model-Checking
- When Trees Grow Low: Shrubs and Fast MSO1
- Deciding first-order properties of locally tree-decomposable structures
- A New Perspective on FO Model Checking of Dense Graph Classes
- Deciding First-Order Properties of Nowhere Dense Graphs
- Approximating rank-width and clique-width quickly
- First-order queries on structures of bounded degree are computable with constant delay
- FO Model Checking of Interval Graphs
- Testing first-order properties for subclasses of sparse graphs
- On low rank-width colorings
This page was built for publication:
