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

DOI10.2298/YJOR130402037HMaRDI QIDQ2975433zbMATHOpenAlexFDO

Authors Alain Hertz, Odile Marcotte, David Schindl

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

extremal graph theoryinduced treeinduced foreststability number

Mathematics Subject Classification ID

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

Recommendations

• Large induced forests in graphs
• Maximum induced trees in graphs
• The Forest Number of (n,m)-Graphs
• Maximum induced forests in graphs of bounded treewidth
• Maximum induced forests of planar graphs

Cited in

(10)

• Induced forests in some distance-regular graphs
• The intersection of all maximum stable sets of a tree and its pendant vertices
• Maximum induced forests of product graphs
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• MIP formulations for induced graph optimization problems: a tutorial
• The Forest Number of (n,m)-Graphs
• Maximum induced trees in graphs
• The forest number in several classes of regular graphs
• scientific article; zbMATH DE number 1735713 (Why is no real title available?)
• 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

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