Maximum induced forests of planar graphs
From MaRDI portal
Publication:1107540
DOI10.1007/BF01788541zbMath0653.05026OpenAlexW1980392837MaRDI QIDQ1107540
Publication date: 1987
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788541
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (15)
Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ A lower bound on the order of the largest induced forest in planar graphs with high girth ⋮ Primal-dual approximation algorithms for feedback problems in planar graphs ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ Induced forests in some distance-regular graphs ⋮ A note on acyclic number of planar graphs ⋮ Large induced forests in planar graphs with girth 4 ⋮ A lower bound on the order of the largest induced linear forest in triangle-free planar graphs ⋮ Induced 2-degenerate subgraphs of triangle-free planar graphs ⋮ Short Proofs of Some Extremal Results ⋮ A better bound on the largest induced forests in triangle-free planar graph ⋮ Large induced forests in triangle-free planar graphs ⋮ SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs ⋮ Large Induced Forests in Graphs
Cites Work
This page was built for publication: Maximum induced forests of planar graphs
