Recommendations
- scientific article; zbMATH DE number 9665
- Maximum induced forests of planar graphs
- Large induced forests in triangle-free planar graphs
- Induced Forests in Regular Graphs with Large Girth
- On maximum induced forests in graphs
- An improved bound on the largest induced forests for triangle-free planar graphs
- A better bound on the largest induced forests in triangle-free planar graph
- Induced forests in cubic graphs
- Large induced forests in planar graphs with girth 4
- Large induced forests in graphs
Cited in
(14)- Cycle isolation of graphs with small girth
- Large induced forests in planar graphs with girth 4
- Induced 2-degenerate subgraphs of triangle-free planar graphs
- A better bound on the largest induced forests in triangle-free planar graph
- On maximum induced forests in graphs
- Induced graphs of uniform spanning forests
- Maximum induced forests of product graphs
- Maximum induced forests of planar graphs
- Large induced forests in sparse graphs
- The size of graphs with given feedback vertex number
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- Forest in biquartic graphs
- Large induced forests in triangle-free planar graphs
- Two trees in maximal planar bipartite graphs
This page was built for publication: Induced forests in bipartite planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501988)