On the maximum orders of an induced forest, an induced tree, and a stable set

DOI10.2298/YJOR130402037HzbMath1464.05040OpenAlexW1975847110MaRDI QIDQ2975433

David Schindl, Alain Hertz, Odile Marcotte

Publication date: 11 April 2017

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor130402037h

zbMATH Keywords

stability numberextremal graph theoryinduced treeinduced forest

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review

This page was built for publication: On the maximum orders of an induced forest, an induced tree, and a stable set