On maximum induced forests in graphs
From MaRDI portal
Publication:1879074
zbMATH Open1052.05025MaRDI QIDQ1879074FDOQ1879074
Authors: N. Punnim 
Publication date: 22 September 2004
Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)
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)
- Maximum induced forests in graphs of bounded treewidth
- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- Induced forests in some distance-regular graphs
- Largest domination number and smallest independence number of forests with given degree sequence
- On the maximum induced forests of a connected cubic graph without triangles
- Maximum induced forests of planar graphs
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- Title not available (Why is that?)
- Induced forests in bipartite planar graphs
- Constrained switchings in cubic graphs.
- Forests in random graphs
- Title not available (Why is that?)
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)
