Maximum induced forests in graphs of bounded treewidth

zbMath1295.05129MaRDI QIDQ396918

Glenn G. Chappell, Michael J. Pelsmajer

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p8

zbMATH Keywords

treewidthchordal graphinduced forest

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (1)

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum induced forests of planar graphs
• On acyclic colorings of planar graphs
• A partial k-arboretum of graphs with bounded treewidth
• Finding independent sets in \(K_4\)-free 4-regular connected graphs
• New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
• Minimum feedback vertex set and acyclic coloring.
• Maximum induced linear forests in outerplanar graphs
• Independent sets in triangle-free cubic planar graphs
• Large induced forests in triangle-free planar graphs
• Large induced forests in sparse graphs
• On the linear vertex-arboricity of a planar graph
• Some Ramsey-Type Numbers and the Independence Ratio
• Size and independence in triangle‐free graphs with maximum degree three
• Acyclic colorings of planar graphs

This page was built for publication: Maximum induced forests in graphs of bounded treewidth