scientific article; zbMATH DE number 4121438
From MaRDI portal
Recommendations
Cited in
(28)- Complexity of path-forming games
- A partial k-arboretum of graphs with bounded treewidth
- On the pathwidth of chordal graphs
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Generalized coloring for tree-like graphs
- Triangulating multitolerance graphs
- Steiner's problem in double trees
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Between clique-width and linear clique-width of bipartite graphs
- How to compute digraph width measures on directed co-graphs
- Using decomposition-parameters for QBF: mind the prefix!
- Linear rank-width and linear clique-width of trees
- Graph drawings with few slopes
- scientific article; zbMATH DE number 1104337 (Why is no real title available?)
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Neighbourhood-width of trees
- The pathwidth and treewidth of cographs
- Bounding the search number of graph products
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
- Approximating Pathwidth for Graphs of Small Treewidth
- Induced subgraphs and path decompositions
- Weakly leveled planarity with bounded span
- Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
- Weakly leveled planarity with bounded span
- Structural properties of graph products
- Inversion diameter and treewidth
- The structure of the models of decidable monadic theories of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734768)
