Degree conditions for forests in graphs
From MaRDI portal
Publication:2581630
Recommendations
- Degree conditions on copies of forests in graphs
- Degree sum conditions for oriented forests in digraphs
- Degree powers in graphs with a forbidden forest
- scientific article; zbMATH DE number 5919777
- Degree conditions and degree bounded trees
- scientific article; zbMATH DE number 1416060
- Decompositions of graphs into forests with bounded maximum degree
- Graphs whose vertices are forests with bounded degree: planarity
- scientific article; zbMATH DE number 2044920
- scientific article; zbMATH DE number 4008408
Cites work
Cited in
(13)- Degree sum conditions for oriented forests in digraphs
- Subtrees and subforests of graphs
- The existence of \(f\)-forests and \(f\)-trees in graphs
- An extremal result for subgraphs with few edges
- Forbidding multiple copies of forestable graphs
- scientific article; zbMATH DE number 5912242 (Why is no real title available?)
- scientific article; zbMATH DE number 5919777 (Why is no real title available?)
- Disjoint cycles with chords in graphs
- scientific article; zbMATH DE number 1222606 (Why is no real title available?)
- Embedding a forest in a graph
- Subforests of bipartite digraphs---the minimum degree condition
- Degree conditions on copies of forests in graphs
- Spanning trees: A survey
This page was built for publication: Degree conditions for forests in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581630)