The following pages link to Large Induced Forests in Graphs (Q4978444):
Displaying 14 items.
- Induced forests in bipartite planar graphs (Q501988) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
- Large induced trees in sparse random graphs (Q1821799) (← links)
- On maximum induced forests in graphs (Q1879074) (← links)
- Induced graphs of uniform spanning forests (Q2028954) (← links)
- The size of graphs with given feedback vertex number (Q2127624) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Cycle isolation of graphs with small girth (Q6131294) (← links)