The following pages link to Subtrees and subforests of graphs (Q1328385):
Displaying 32 items.
- On the Turán number of forests (Q396789) (← links)
- Embedding a forest in a graph (Q540102) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735) (← links)
- Subdivisions of graphs: A generalization of paths and cycles (Q941389) (← links)
- Degree condition for subdivisions of unicyclic graphs (Q1015434) (← links)
- Degree sum conditions for oriented forests in digraphs (Q1044001) (← links)
- Expanding graphs contain all small trees (Q1092058) (← links)
- Forestation in hypergraphs: Linear \(k\)-trees (Q1408553) (← links)
- Fully leafed induced subtrees (Q1670988) (← links)
- An extremal result for subgraphs with few edges (Q1898723) (← links)
- The Erdös-Sós conjecture for graphs of girth 5 (Q1916132) (← links)
- Unavoidable subtrees (Q1946660) (← links)
- Subtrees of bipartite digraphs---the minimum degree condition (Q1962047) (← links)
- The Turán number of star forests (Q2008823) (← links)
- Equating \(\kappa\) maximum degrees in graphs without short cycles (Q2175241) (← links)
- Characterization of double domination subdivision number of trees (Q2381533) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Degree conditions for forests in graphs (Q2581630) (← links)
- Erdős-type condition for a graph to contain \(k\) independent edges (Q2741374) (← links)
- A note on uniquely embeddable forests (Q2866461) (← links)
- Oriented Forests in Directed Graphs (Q3439324) (← links)
- (Q3476826) (← links)
- Disjoint cycles with chords in graphs (Q3605162) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- (Q3689204) (← links)
- On the number of subtrees for almost all graphs (Q4288890) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- On Subtrees of Directed Graphs with No Path of Length Exceeding One (Q5598934) (← links)
- Subforests of bipartite digraphs---the minimum degree condition (Q5959113) (← links)
- Degree conditions on copies of forests in graphs (Q6093997) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
