On the stability number of AH‐free graphs

DOI10.1002/JGT.3190170107MaRDI QIDQ4693344zbMATH OpenOpenAlexFDO

Authors Alain Hertz, Dominique De Werra

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

AH-free graphsclass of graphspolynomial time algorithmstability number

Mathematics Subject Classification ID

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

Recommendations

• Stability number in subclasses of \(P_5\)-free graphs
• Polynomially solvable cases for the maximum stable set problem
• scientific article; zbMATH DE number 1208717
• scientific article; zbMATH DE number 1833095
• Stability in CAN-free graphs

Cited in

(13)

• Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
• Claw-free graphs---a survey
• On the use of Boolean methods for the computation of the stability number
• Struction revisited
• Stability number in subclasses of \(P_5\)-free graphs
• Polynomially solvable cases for the maximum stable set problem
• Letter graphs and modular decomposition
• New potential functions for greedy independence and coloring
• scientific article; zbMATH DE number 1208717 (Why is no real title available?)
• Stability number and [a,b]‐factors in graphs
• Bi-induced sub graphs and stability number
• Stability preserving transformations of graphs
• Graphs without large apples and the maximum weight independent set problem

This page was built for publication: On the stability number of AH‐free graphs

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