scientific article; zbMATH DE number 7029306
From MaRDI portal
Publication:4625695
Petr Hliněný, Jan Obdržálek, Jaroslav Nešetřil, Robert Ganian, Patrice Ossona de Mendez
Publication date: 25 February 2019
Full work available at URL: https://arxiv.org/abs/1707.00359
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Structural characterization of families of graphs (05C75)
Related Items (17)
The Micro-world of Cographs ⋮ The micro-world of cographs ⋮ Rainbow independent sets on dense graph classes ⋮ Notes on complexity of packing coloring ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Critical properties of bipartite permutation graphs ⋮ Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space ⋮ Clustering powers of sparse graphs ⋮ Regular partitions of gentle graphs ⋮ The average cut-rank of graphs ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Unnamed Item ⋮ Obstructions for bounded shrub-depth and rank-depth ⋮ Scattered Classes of Graphs ⋮ Critical properties and complexity measures of read-once Boolean functions ⋮ Erdös--Hajnal Properties for Powers of Sparse Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree-depth and vertex-minors
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Sparsity. Graphs, structures, and algorithms
- \(k\)-NLC graphs and polynomial algorithms
- Algorithmic meta-theorems for restrictions of treewidth
- Optimal node ranking of tree in linear time
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- The complexity of first-order and monadic second-order logic revisited
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- When Trees Grow Low: Shrubs and Fast MSO1
- Where First-Order and Monadic Second-Order Logic Coincide
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
- On the Monadic Second-Order Transduction Hierarchy
- Graph minors. II. Algorithmic aspects of tree-width
- Subgraphs and well‐quasi‐ordering
- Rankings of Graphs
- Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
- Model Checking Lower Bounds for Simple Graphs
- Finding Branch-Decompositions and Rank-Decompositions
This page was built for publication:
