Pages that link to "Item:Q2341752"
From MaRDI portal
The following pages link to Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752):
Displaying 6 items.
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Induced subgraphs of bounded treewidth and the container method (Q6550989) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
