Maximum induced forests in graphs of bounded treewidth
From MaRDI portal
Publication:396918
zbMATH Open1295.05129MaRDI QIDQ396918FDOQ396918
Authors: 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
Recommendations
- On maximum induced forests in graphs
- Maximum induced forests of planar graphs
- Maximum induced trees in graphs
- Maximum induced forests in random graphs
- A better bound on the largest induced forests in triangle-free planar graph
- Maximum induced linear forests in outerplanar graphs
- An improved bound on the largest induced forests for triangle-free planar graphs
- Induced Forests in Regular Graphs with Large Girth
- scientific article; zbMATH DE number 9665
- A lower bound on the order of the largest induced forest in planar graphs with high girth
Cites Work
- Title not available (Why is that?)
- On acyclic colorings of planar graphs
- A partial k-arboretum of graphs with bounded treewidth
- Large induced forests in sparse graphs
- Title not available (Why is that?)
- Size and independence in triangle‐free graphs with maximum degree three
- Title not available (Why is that?)
- Minimum feedback vertex set and acyclic coloring.
- Independent sets in triangle-free cubic planar graphs
- Title not available (Why is that?)
- Maximum induced forests of planar graphs
- Large induced forests in triangle-free planar graphs
- Title not available (Why is that?)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs
- Threshold for path colorings of planar graphs
- Acyclic colorings of planar graphs
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
- Maximum induced linear forests in outerplanar graphs
- On the linear vertex-arboricity of a planar graph
- Some Ramsey-Type Numbers and the Independence Ratio
- Title not available (Why is that?)
- Title not available (Why is that?)
- Induced subgraphs of bounded degree and bounded treewidth
Cited In (12)
- Product dimension of forests and bounded treewidth graphs
- Title not available (Why is that?)
- Induced subgraphs of bounded degree and bounded treewidth
- On maximum induced forests in graphs
- On the maximum induced forests of a connected cubic graph without triangles
- The \(k\)-strong induced arboricity of a graph
- On the maximum orders of an induced forest, an induced tree, and a stable set
- Maximum induced forests of planar graphs
- Graph-Theoretic Concepts in Computer Science
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
- Well-indumatched Trees and Graphs of Bounded Girth
- Maximal trees with bounded maximum degree in a graph
This page was built for publication: Maximum induced forests in graphs of bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396918)
