Recommendations
- scientific article; zbMATH DE number 1792598
- An extremal result for subgraphs with few edges
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- On the Erd�s-S�s conjecture
- Embedding a forest in a graph
- Degree conditions for forests in graphs
- Embedding trees into graphs of large girth
- The Erdös-Sós conjecture for graphs of girth 5
- Erdős-type condition for a graph to contain \(k\) independent edges
- Constructing trees in graphs with no K2,s
Cited in
(36)- scientific article; zbMATH DE number 3989380 (Why is no real title available?)
- Embedding a forest in a graph
- Equating \(\kappa\) maximum degrees in graphs without short cycles
- On Subtrees of Directed Graphs with No Path of Length Exceeding One
- The Turán number of star forests
- Subtrees of bipartite digraphs---the minimum degree condition
- Algorithms on Subtree Filament Graphs
- An extremal result for subgraphs with few edges
- Spanning trees: A survey
- Expanding graphs contain all small trees
- On the Turán number of forests
- The Erdös-Sós conjecture for graphs of girth 5
- scientific article; zbMATH DE number 3884200 (Why is no real title available?)
- scientific article; zbMATH DE number 4145922 (Why is no real title available?)
- Degree conditions for forests in graphs
- Forestation in hypergraphs: Linear \(k\)-trees
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- Degree conditions on copies of forests in graphs
- Tree densities in sparse graph classes
- Degree condition for subdivisions of unicyclic graphs
- Oriented Forests in Directed Graphs
- Fully leafed induced subtrees
- Erdős-type condition for a graph to contain \(k\) independent edges
- scientific article; zbMATH DE number 3912404 (Why is no real title available?)
- On the number of subtrees for almost all graphs
- Degree sum conditions for oriented forests in digraphs
- Unavoidable subtrees
- scientific article; zbMATH DE number 3935064 (Why is no real title available?)
- Game matching number of graphs
- On the chromatic number of \(H\)-free graphs of large minimum degree
- Disjoint cycles with chords in graphs
- Characterization of double domination subdivision number of trees
- A note on uniquely embeddable forests
- Subdivisions of graphs: A generalization of paths and cycles
- Subforests of bipartite digraphs---the minimum degree condition
- A note on graphs containing all trees of a given size.
This page was built for publication: Subtrees and subforests of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328385)
