On the stability number of AH‐free graphs

DOI10.1002/jgt.3190170107zbMath0829.05038OpenAlexW2050415766MaRDI QIDQ4693344

Dominique de Werra, Alain Hertz

Publication date: 10 January 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170107

zbMATH Keywords

stability numberpolynomial time algorithmclass of graphsAH-free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items

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, Struction revisited, Stability preserving transformations of graphs, New potential functions for greedy independence and coloring, Graphs without large apples and the maximum weight independent set problem, Letter graphs and modular decomposition