Pages that link to "Item:Q3614197"
From MaRDI portal
The following pages link to Tree-Related Widths of Graphs and Hypergraphs (Q3614197):
Displaying 17 items.
- Computing hypergraph width measures exactly (Q437685) (← links)
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- (Q4352948) (← links)
- Tree-width and circumference of graphs (Q4808403) (← links)
- The treewidth of 2-section of hypergraphs (Q5024663) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Tree-width and path-width of comparability graphs of interval orders (Q6184354) (← links)
- On the treewidth of Hanoi graphs (Q6487581) (← links)