Minimum size of feedback vertex sets of planar graphs of girth at least five

DOI10.1016/j.ejc.2016.10.009zbMath1352.05057arXiv1603.04559OpenAlexW2301667118MaRDI QIDQ730261

Tom Kelly, Chun-Hung Liu

Publication date: 27 December 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

induced forestdecycling numberforest number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (11)

The size of graphs with given feedback vertex number ⋮ Partial DP-coloring of graphs ⋮ Robust Connectivity of Graphs on Surfaces ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Splitting plane graphs to outerplanarity ⋮ Maximum induced forests of product graphs ⋮ Cycle isolation of graphs with small girth ⋮ Large induced forests in planar graphs with girth 4 ⋮ Induced 2-degenerate subgraphs of triangle-free planar 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
• Large induced forests in triangle-free planar graphs
• Large induced forests in sparse graphs
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum size of feedback vertex sets of planar graphs of girth at least five