Pages that link to "Item:Q2781059"
From MaRDI portal
The following pages link to Large induced forests in sparse graphs (Q2781059):
Displaying 22 items.
- Regular independent sets (Q260019) (← links)
- 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)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Minimum size of feedback vertex sets of planar graphs of girth at least five (Q730261) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← 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)
- The integrity of a cubic graph (Q1827848) (← links)
- Remarks on dynamic monopolies with given average thresholds (Q2259575) (← links)
- Large induced forests in triangle-free planar graphs (Q2494123) (← links)
- Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- A note on acyclic number of planar graphs (Q4604518) (← links)
- Large Induced Forests in Graphs (Q4978444) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Short Proofs of Some Extremal Results (Q5414143) (← links)
- (Q5708559) (← links)
- Cycle isolation of graphs with small girth (Q6131294) (← links)
- Induced forests in some distance-regular graphs (Q6153467) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
