The following pages link to Girth and treewidth (Q707020):
Displaying 17 items.
- Learning loopy graphical models with latent variables: efficient methods and guarantees (Q355078) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- The carvingwidth of hypercubes (Q2509307) (← links)
- Isoperimetric Problem and Meta-fibonacci Sequences (Q3511309) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- (Q5090998) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (Q6094029) (← links)
