Large induced forests in planar graphs with girth 4
Authors:
- François DrossFDFrançois Dross
- Mickael MontassierMMMickael Montassier
- Alexandre PinlouAPAlexandre Pinlou
- 1 February 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 254, 96-106
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ANR grant HOSIGRA (ANR-17-CE40-0022-03)
This publication has 7 references indexed in Scilit:
- Minimum size of feedback vertex sets of planar graphs of girth at least fiveEuropean Journal of Combinatorics, 2017
- Short Proofs of Some Extremal ResultsCombinatorics, Probability and Computing, 2013
- Large Induced Forests in Triangle-Free Planar GraphsGraphs and Combinatorics, 2006
- Problems and results in extremal combinatorics—IDiscrete Mathematics, 2003
- Minimum feedback vertex set and acyclic coloringInformation Processing Letters, 2002
- Large induced forests in sparse graphsJournal of Graph Theory, 2001
- Maximum induced forests of planar graphsGraphs and Combinatorics, 1987