A magnetic procedure for the stability number

DOI10.1007/s00373-010-0886-0zbMath1205.05168OpenAlexW2091675867MaRDI QIDQ968215

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

zbMATH Keywords

stable seteven pairgraph transformation\(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)

Related Items

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

Cites Work

• Weakly triangulated graphs
• The strong perfect graph theorem
• The ellipsoid method and its consequences in combinatorial optimization
• On the use of Boolean methods for the computation of the stability number
• Normal hypergraphs and the perfect graph conjecture
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• Generating weakly triangulated graphs
• Graph transformations preserving the stability number
• Unnamed Item
• Unnamed Item
• Unnamed Item