Struction revisited
From MaRDI portal
Publication:1414580
DOI10.1016/S0166-218X(03)00388-3zbMath1029.05076OpenAlexW2912725667MaRDI QIDQ1414580
Dominique de Werra, Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin
Publication date: 4 December 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00388-3
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
From matchings to independent sets ⋮ Edge cover by connected bipartite subgraphs ⋮ Stability preserving transformations of graphs ⋮ 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 ⋮ Graph transformations preserving the stability number ⋮ Graph transformations preserving the stability number ⋮ Maximum independent sets in subcubic graphs: new results ⋮ The maximum independent set problem in subclasses of subcubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Stability in CAN-free graphs
- The struction of a graph: Application to CN-free graphs
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
- Matching theory
- Stability number of bull- and chair-free graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- The struction algorithm for the maximum stable set problem revisited
- On the use of Boolean methods for the computation of the stability number
- Conic reduction of graphs for the stable set problem
- Stability in \(P_5\)- and banner-free graphs
- An augmentation algorithm for the maximum weighted stable set problem
- On the stable set problem in special \(P_{5}\)-free graphs
- Polynomially solvable cases for the maximum stable set problem
- The basic algorithm for pseudo-Boolean programming revisited
- Vertex Cover: Further Observations and Further Improvements
- On Some Properties of the Struction of a Graph
- Stability in circular arc graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- On the stability number of AH‐free graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- An upper bound on the number of cliques in a graph
- Paths, Trees, and Flowers
This page was built for publication: Struction revisited
