A magnetic procedure for the stability number

DOI10.1007/S00373-010-0886-0zbMATH Open1205.05168OpenAlexW2091675867MaRDI QIDQ968215FDOQ968215

Authors: Alain Hertz, Dominique De Werra 

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0886-0

Recommendations

• Stability number of bull- and chair-free graphs
• Minimum degree algorithms for stability number
• Polynomially solvable cases for the maximum stable set problem
• On the use of Boolean methods for the computation of the stability number
• scientific article; zbMATH DE number 1161356

zbMATH Keywords

stable setgraph transformationeven pair\(P_{4}\)-free pairmagnet

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Normal hypergraphs and the perfect graph conjecture
• The ellipsoid method and its consequences in combinatorial optimization
• The strong perfect graph theorem
• Weakly triangulated graphs
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• On the use of Boolean methods for the computation of the stability number
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating weakly triangulated graphs
• Graph transformations preserving the stability number

Cited In (2)

• From matchings to independent sets
• Graph transformations preserving the stability number

This page was built for publication: A magnetic procedure for the stability number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968215)