The following pages link to TREEWIDTH OF CIRCLE GRAPHS (Q4886311):
Displaying 14 items.
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- (Q5115821) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Treewidth, circle graphs and circular drawings (Q6630449) (← links)
