Induced forests in bipartite planar graphs
From MaRDI portal
Publication:501988
DOI10.4310/JOC.2017.v8.n1.a5zbMath1352.05053arXiv1605.00047MaRDI QIDQ501988
Yan Wang, Qiqin Xie, Xingxing Yu
Publication date: 10 January 2017
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00047
Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (6)
The size of graphs with given feedback vertex number ⋮ Maximum induced forests of product graphs ⋮ Cycle isolation of graphs with small girth ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ Induced 2-degenerate subgraphs of triangle-free planar graphs ⋮ A better bound on the largest induced forests in triangle-free planar graph
This page was built for publication: Induced forests in bipartite planar graphs
