On vertex orderings and the stability number in triangle-free graphs

DOI10.1016/S0012-365X(00)00335-6zbMath0983.05071OpenAlexW2073631490MaRDI QIDQ5937606

Dieter Rautenbach

Publication date: 21 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00335-6

zbMATH Keywords

greedy algorithmcharacterizationstability numberforbidden induced subgraphsmaximal stable settriangle-free graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

GreedyMAX-type Algorithms for the Maximum Independent Set Problem

This page was built for publication: On vertex orderings and the stability number in triangle-free graphs