Large Induced Forests in Graphs

DOI10.1002/jgt.22104zbMath1368.05034OpenAlexW2558789634MaRDI QIDQ4978444

Hong-Yu Xu, Ling-Sheng Shi

Publication date: 10 August 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22104

zbMATH Keywords

girthtriangle-freeplanar graphinduced forestacyclic set

Mathematics Subject Classification ID

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

Related Items

The size of graphs with given feedback vertex number ⋮ Robust Connectivity of Graphs on Surfaces ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Maximum induced forests of product graphs ⋮ Cycle isolation of graphs with small girth ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ Acyclic polynomials of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Large induced trees in \(K_r\)-free graphs
• Maximum induced trees in graphs
• Large induced degenerate subgraphs
• Maximum induced forests of planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Problems and results in extremal combinatorics. I.
• Large induced forests in triangle-free planar graphs
• Large induced forests in sparse graphs
• 2-Isomorphic Graphs