Recommendations
- Clique cutsets beyond chordal graphs
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- The world of hereditary graph classes viewed through Truemper configurations
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
- The (theta, wheel)-free graphs. II: Structure theorem
Cited in
(14)- On the tree-width of even-hole-free graphs
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- Clique cutsets beyond chordal graphs
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- The world of hereditary graph classes viewed through Truemper configurations
- Coloring rings
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- Coloring (4K₁,C₄,C₆)-free graphs
- Graphs with all holes the same length
- Bisimplicial separators
- Thick forests
- A characterization of minimally connected graphs without 2-clique cutsets
- Maximizing the spectral radius of minimally connected graphs with size m and no 2-clique cutsets
This page was built for publication: Clique-cutsets beyond chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5379846)
