Packing graphs with odd and even trees
From MaRDI portal
Recommendations
Cited in
(15)- Two packing problems on \(k\)-matroid trees
- Packing of graphs - a survey
- scientific article; zbMATH DE number 4132205 (Why is no real title available?)
- scientific article; zbMATH DE number 4145943 (Why is no real title available?)
- scientific article; zbMATH DE number 3924795 (Why is no real title available?)
- scientific article; zbMATH DE number 4063141 (Why is no real title available?)
- scientific article; zbMATH DE number 89770 (Why is no real title available?)
- scientific article; zbMATH DE number 1043871 (Why is no real title available?)
- Packing odd T‐joins with at most two terminals
- scientific article; zbMATH DE number 4198019 (Why is no real title available?)
- On the roots of degree polynomials
- Packing large balanced trees into bipartite graphs
- Odd path packings
- Packing sequences
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
This page was built for publication: Packing graphs with odd and even trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220604)