scientific article; zbMATH DE number 9665
From MaRDI portal
Publication:3971782
Cited in
(25)- Maximum induced forests of planar graphs
- Induced and weak induced arboricities
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
- Large induced forests in planar graphs with girth 4
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
- On maximum induced forests in graphs
- Induced graphs of uniform spanning forests
- Moderately exponential time algorithms for the maximum induced matching problem
- Large induced forests in triangle-free planar graphs
- Rooted induced trees in triangle-free graphs
- A lower bound on the order of the largest induced forest in planar graphs with high girth
- Feedback vertex number of Sierpiński-type graphs
- Oriented Forests in Directed Graphs
- Maximum induced forests in graphs of bounded treewidth
- scientific article; zbMATH DE number 1953106 (Why is no real title available?)
- Size of the largest induced forest in subcubic graphs of girth at least four and five
- Forests and trees among Gallai graphs
- Induced forests in bipartite planar graphs
- Well-indumatched Trees and Graphs of Bounded Girth
- Robust connectivity of graphs on surfaces
- On the induced matching problem
- The decycling number of a line graph
- The decycling number of a graph with large girth embedded in a surface
- The decycling number of a planar graph covered by K₄-subgraphs
- Decycling number of type-k Halin graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971782)
