Size of the largest induced forest in subcubic graphs of girth at least four and five

DOI10.1002/jgt.22361zbMath1473.05144arXiv1603.03855OpenAlexW2963809247WikidataQ129906759 ScholiaQ129906759MaRDI QIDQ4646949

Tom Kelly, Chun-Hung Liu

Publication date: 3 January 2019

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

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

zbMATH Keywords

subcubic graphsinduced forestsfeedback vertex-sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

The size of graphs with given feedback vertex number ⋮ Maximum induced forests of product graphs ⋮ Cycle isolation of graphs with small girth ⋮ Induced forests in some distance-regular graphs ⋮ A better bound on the largest induced forests in triangle-free planar graph

This page was built for publication: Size of the largest induced forest in subcubic graphs of girth at least four and five