The following pages link to (Q3035321):
Displaying 8 items.
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Decomposition by maxclique separators (Q2918475) (← links)
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem (Q3596359) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)
- Computing and Combinatorics (Q4681172) (← links)