The following pages link to (Q3971782):
Displaying 22 items.
- A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Forests and trees among Gallai graphs (Q472964) (← links)
- Induced forests in bipartite planar graphs (Q501988) (← links)
- On the induced matching problem (Q657915) (← links)
- Maximum induced forests of planar graphs (Q1107540) (← links)
- Induced and weak induced arboricities (Q1625812) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (Q1727766) (← links)
- On maximum induced forests in graphs (Q1879074) (← links)
- Induced graphs of uniform spanning forests (Q2028954) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Large induced forests in triangle-free planar graphs (Q2494123) (← links)
- Rooted induced trees in triangle-free graphs (Q3055916) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- Oriented Forests in Directed Graphs (Q3439324) (← links)
- (Q4414510) (← links)
- Size of the largest induced forest in subcubic graphs of girth at least four and five (Q4646949) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- The decycling number of a line graph (Q6646413) (← links)
