Stability in CAN-free graphs
From MaRDI portal
Publication:762505
DOI10.1016/0095-8956(85)90089-9zbMath0558.05053OpenAlexW2050715071MaRDI QIDQ762505
Peter L. Hammer, Dominique de Werra, N. V. R. Mahadev
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90089-9
Related Items (16)
The struction algorithm for the maximum stable set problem revisited ⋮ Polynomially solvable cases for the maximum stable set problem ⋮ Claw-free graphs---a survey ⋮ On the use of Boolean methods for the computation of the stability number ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Struction revisited ⋮ Stability preserving transformations of graphs ⋮ Hamiltonicity in claw-free graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ A polynomial algorithm to find an independent set of maximum weight in a fork-free graph ⋮ Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization ⋮ Pseudo-Boolean optimization ⋮ Consensus algorithms for the generation of all maximal bicliques ⋮ On the complexity of the independent set problem in triangle graphs ⋮ The struction of a graph: Application to CN-free graphs ⋮ Local transformations of graphs preserving independence number
Cites Work
This page was built for publication: Stability in CAN-free graphs