Pages that link to "Item:Q1372729"
From MaRDI portal
The following pages link to Treewidth for graphs with small chordality (Q1372729):
Displaying 22 items.
- Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
- A Dirac-type characterization of \(k\)-chordal graphs (Q394280) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- A spectral lower bound for the treewidth of a graph and its consequences (Q1014419) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Tree-width dichotomy (Q2136198) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- In absence of long chordless cycles, large tree-width becomes a local phenomenon (Q2338644) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
