Construction of a Maximum Stable Set with $k$-Extensions

DOI10.1017/S0963548304006376zbMath1063.05106MaRDI QIDQ4680569

Peter L. Hammer, Igor Edm. Zverovich

Publication date: 7 June 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

independent setgraph algorithmsforbidden subgraphshereditary classes

Mathematics Subject Classification ID

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

Related Items (2)

Stability number in subclasses of \(P_5\)-free graphs ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product

This page was built for publication: Construction of a Maximum Stable Set with $k$-Extensions