A lower bound on the order of the largest induced forest in planar graphs with high girth

DOI10.1016/j.dam.2016.06.011zbMath1346.05039arXiv1504.01949OpenAlexW2243378012MaRDI QIDQ317411

François Dross, Alexandre Pinlou, Mickaël Montassier

Publication date: 30 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.01949

zbMATH Keywords

planar graphfeedback vertex setinduced forestlarge girth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items

Unnamed Item, A lower bound on the order of the largest induced forest in planar graphs with high girth, MIP formulations for induced graph optimization problems: a tutorial, Maximum induced forests of product graphs, Cycle isolation of graphs with small girth, Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph, 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, The k-conversion number of regular graphs, Feedback vertex number of Sierpiński-type graphs

Cites Work

• A lower bound on the order of the largest induced forest in planar graphs with high girth
• Maximum induced forests of planar graphs
• Problems and results in extremal combinatorics. I.
• A new bound on the feedback vertex sets in cubic graphs
• Large induced forests in triangle-free planar graphs
• Large induced forests in sparse graphs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Short Proofs of Some Extremal Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item