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

DOI10.2298/YJOR130402037HzbMATH Open1464.05040OpenAlexW1975847110MaRDI QIDQ2975433FDOQ2975433

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

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

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)

Cited In (9)

• The Forest Number of (n,m)-Graphs
• The intersection of all maximum stable sets of a tree and its pendant vertices
• Maximum induced forests of product graphs
• MIP formulations for induced graph optimization problems: a tutorial
• Maximum induced trees in graphs
• Maximum weighted induced forests and trees: new formulations and a computational comparative review
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• Title not available (Why is that?)
• The forest number in several classes of regular graphs

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)