Subtrees and subforests of graphs
From MaRDI portal
Publication:1328385
DOI10.1006/JCTB.1994.1030zbMATH Open0804.05024OpenAlexW2049309804MaRDI QIDQ1328385FDOQ1328385
Authors: Stephan Brandt 
Publication date: 9 January 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1030
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
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (36)
- On Subtrees of Directed Graphs with No Path of Length Exceeding One
- Equating \(\kappa\) maximum degrees in graphs without short cycles
- Embedding a forest in a graph
- The Turán number of star forests
- Algorithms on Subtree Filament Graphs
- Subtrees of bipartite digraphs---the minimum degree condition
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Oriented Forests in Directed Graphs
- Degree condition for subdivisions of unicyclic graphs
- Fully leafed induced subtrees
- Erdős-type condition for a graph to contain \(k\) independent edges
- Title not available (Why is that?)
- On the number of subtrees for almost all graphs
- Degree sum conditions for oriented forests in digraphs
- Unavoidable subtrees
- Title not available (Why is that?)
- Game matching number of graphs
- Disjoint cycles with chords in graphs
- On the chromatic number of \(H\)-free graphs of large minimum degree
- Characterization of double domination subdivision number of trees
- Subforests of bipartite digraphs---the minimum degree condition
- A note on uniquely embeddable forests
- Subdivisions of graphs: A generalization of paths and cycles
- A note on graphs containing all trees of a given size.
- Title not available (Why is that?)
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)
