Maximum induced forests of planar graphs
From MaRDI portal
Publication:1107540
DOI10.1007/BF01788541zbMATH Open0653.05026OpenAlexW1980392837MaRDI QIDQ1107540FDOQ1107540
Authors: Jin Akiyama, Mamoru Watanabe 
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788541
Recommendations
- On maximum induced forests in graphs
- Maximum induced forests in graphs of bounded treewidth
- Maximum induced linear forests in outerplanar graphs
- Large induced forests in triangle-free planar graphs
- Induced forests in bipartite planar graphs
- An improved bound on the largest induced forests for triangle-free planar graphs
- A lower bound on the order of the largest induced forest in planar graphs with high girth
- A better bound on the largest induced forests in triangle-free planar graph
- scientific article; zbMATH DE number 9665
- Maximum induced trees in graphs
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (21)
- Maximum induced forests in graphs of bounded treewidth
- Large induced forests in planar graphs with girth 4
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Large induced forests in graphs
- A note on acyclic number of planar graphs
- Induced forests in some distance-regular graphs
- Primal-dual approximation algorithms for feedback problems in planar graphs
- 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
- On the maximum induced forests of a connected cubic graph without triangles
- A lower bound on the order of the largest induced forest in planar graphs with high girth
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- On the maximum orders of an induced forest, an induced tree, and a stable set
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
- Short proofs of some extremal results
- Induced forests in bipartite planar graphs
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- 3‐Degenerate induced subgraph of a planar graph
- Large induced forests in triangle-free planar graphs
This page was built for publication: Maximum induced forests of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107540)
