The following pages link to (Q4252036):
Displaying 16 items.
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Listing all the minimal separators of a 3-connected planar graph (Q819830) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation (Q2114466) (← links)
- Treewidth and minimum fill-in: Grouping the minimal separators (Q2784449) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Minimal separators in \(P_4\)-tidy graphs (Q2840517) (← links)
- On the Minimal Density of Triangles in Graphs (Q3527546) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs (Q5366960) (← links)
