Stabex method for extension of \(\alpha\)-polynomial hereditary classes.

DOI10.1016/S0377-2217(02)00888-3zbMath1044.05065OpenAlexW2075853839MaRDI QIDQ1427601

Igor Edm. Zverovich

Publication date: 14 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00888-3

zbMATH Keywords

Polynomial-time algorithmStability numberHereditary class

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Stability number in subclasses of \(P_5\)-free graphs

Cites Work

• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Stability in \(P_5\)- and banner-free graphs
• A note on \(\alpha\)-redundant vertices in graphs

This page was built for publication: Stabex method for extension of \(\alpha\)-polynomial hereditary classes.