The following pages link to Stability in CAN-free graphs (Q762505):
Displaying 14 items.
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- The struction of a graph: Application to CN-free graphs (Q1068855) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Struction revisited (Q1414580) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
