Large induced forests in triangle-free planar graphs

DOI10.1007/s00373-006-0642-7zbMath1092.05020OpenAlexW2025085400MaRDI QIDQ2494123

Mohammad R. Salavatipour

Publication date: 16 June 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0642-7

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

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 ⋮ Robust Connectivity of Graphs on Surfaces ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ A note on acyclic number of planar graphs ⋮ Large induced forests in planar graphs with girth 4 ⋮ On the induced matching problem ⋮ Short Proofs of Some Extremal Results ⋮ A better bound on the largest induced forests in triangle-free planar graph ⋮ Minimum size of feedback vertex sets of planar graphs of girth at least five ⋮ Cycle intersection graphs and minimum decycling sets of even graphs ⋮ Large Induced Forests in Graphs ⋮ Feedback vertex number of Sierpiński-type graphs

Cites Work

• Maximum induced forests of planar graphs
• Problems and results in extremal combinatorics. I.
• Large induced forests in sparse graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large induced forests in triangle-free planar graphs