The following pages link to Treewidth of Circular-Arc Graphs (Q4317710):
Displayed 11 items.
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← 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)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)