On large induced outerplanar subgraphs in 2-outerplanar graphs
From MaRDI portal
Cites work
- 3‐Degenerate induced subgraph of a planar graph
- A better bound on the largest induced forests in triangle-free planar graph
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
- An improved bound on the largest induced forests for triangle-free planar graphs
- Graphs with homeomorphically irreducible spanning trees
- scientific article; zbMATH DE number 9665 (Why is no real title available?)
- Induced forests in bipartite planar graphs
- Induced matchings in subcubic planar graphs
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- Large induced forests in graphs
- Large induced forests in planar graphs with girth 4
- Large induced forests in triangle-free planar graphs
- Lower Bounds For Induced Forests in Cubic Graphs
- Maximum 4-degenerate subgraph of a planar graph
- Maximum induced forests in graphs of bounded treewidth
- Maximum induced forests of planar graphs
- Maximum induced linear forests in outerplanar graphs
- Minimum feedback vertex set and acyclic coloring.
- On the linear vertex-arboricity of a planar graph
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Size of the largest induced forest in subcubic graphs of girth at least four and five
This page was built for publication: On large induced outerplanar subgraphs in 2-outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402302)