Pages that link to "Item:Q2227825"
From MaRDI portal
The following pages link to Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825):
Displaying 5 items.
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- (Q3011753) (← links)
- (Q5488895) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)