Pages that link to "Item:Q5379846"
From MaRDI portal
The following pages link to Clique‐cutsets beyond chordal graphs (Q5379846):
Displaying 9 items.
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Coloring rings (Q6055414) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816) (← links)
- Graphs with all holes the same length (Q6564607) (← links)
- Bisimplicial separators (Q6565812) (← links)