On maximum induced forests in graphs
From MaRDI portal
Recommendations
- Maximum induced forests in graphs of bounded treewidth
- Maximum induced forests of planar graphs
- Maximum induced forests in random graphs
- Maximum induced trees in graphs
- Maximum induced forests of product graphs
- Large induced forests in graphs
- Maximum induced linear forests in outerplanar graphs
- Induced Forests in Regular Graphs with Large Girth
- scientific article; zbMATH DE number 9665
- Induced forests in bipartite planar graphs
Cited in
(12)- Forests in random graphs
- Induced forests in some distance-regular graphs
- Maximum induced forests of planar graphs
- On the maximum induced forests of a connected cubic graph without triangles
- Largest domination number and smallest independence number of forests with given degree sequence
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- Maximum induced forests in graphs of bounded treewidth
- Constrained switchings in cubic graphs.
- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- Induced forests in bipartite planar graphs
- scientific article; zbMATH DE number 123817 (Why is no real title available?)
- scientific article; zbMATH DE number 4137789 (Why is no real title available?)
This page was built for publication: On maximum induced forests in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879074)