The following pages link to (Q3575471):
Displaying 10 items.
- A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
- Minimum size of feedback vertex sets of planar graphs of girth at least five (Q730261) (← links)
- Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
- A better bound on the largest induced forests in triangle-free planar graph (Q1756090) (← links)
- A note on acyclic number of planar graphs (Q4604518) (← links)
- The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
- Large Induced Forests in Graphs (Q4978444) (← links)
- (Q5197598) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
