Subtrees and subforests of graphs
From MaRDI portal
Publication:1328385
DOI10.1006/JCTB.1994.1030zbMath0804.05024OpenAlexW2049309804MaRDI QIDQ1328385
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
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (15)
Characterization of double domination subdivision number of trees ⋮ The Erdös-Sós conjecture for graphs of girth 5 ⋮ On the Turán number of forests ⋮ Degree conditions on copies of forests in graphs ⋮ Subtrees of bipartite digraphs---the minimum degree condition ⋮ Game matching number of graphs ⋮ Spanning trees: A survey ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Subdivisions of graphs: A generalization of paths and cycles ⋮ The Turán number of star forests ⋮ Disjoint cycles with chords in graphs ⋮ Degree condition for subdivisions of unicyclic graphs ⋮ Degree sum conditions for oriented forests in digraphs ⋮ Degree conditions for forests in graphs ⋮ Oriented Forests in Directed Graphs
This page was built for publication: Subtrees and subforests of graphs
