Large induced forests in planar graphs with girth 4

DOI10.1016/j.dam.2018.06.029zbMath1404.05036arXiv1409.1348OpenAlexW2964130394MaRDI QIDQ1720314

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

Publication date: 8 February 2019

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

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

zbMATH Keywords

planar graphsfeedback vertex setstriangle-free planar graphsAlbertson-Berman conjectureinduced forests

Mathematics Subject Classification ID

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

Related Items (6)

Unnamed Item ⋮ Robust Connectivity of Graphs on Surfaces ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum induced forests of product graphs ⋮ Cycle isolation of graphs with small girth ⋮ The k-conversion number of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum size of feedback vertex sets of planar graphs of girth at least five
• Maximum induced forests of planar graphs
• Problems and results in extremal combinatorics. I.
• Minimum feedback vertex set and acyclic coloring.
• Large induced forests in triangle-free planar graphs
• Large induced forests in sparse graphs
• Short Proofs of Some Extremal Results

This page was built for publication: Large induced forests in planar graphs with girth 4