scientific article; zbMATH DE number 3604921
From MaRDI portal
Publication:4170743
Cited in
(43)- Packing trees in complete graphs
- A note on path-perfect graphs
- Two packing problems on \(k\)-matroid trees
- On packing trees into complete bipartite graphs
- A note on packing of three forests
- Packing of graphs - a survey
- Balanced integer arrays: a matrix packing theorem
- Some remarks on packing trees
- Packing trees in complete bipartite graphs
- The spectrum of optimal excess graphs for trees with up to four edges
- Embedding rainbow trees with applications to graph labelling and decomposition
- Packing a number of copies of a \(( p , q )\)-graph
- A proof of Ringel's conjecture
- Optimal packings of bounded degree trees
- Packing degenerate graphs
- Packing large trees of consecutive orders
- Packing trees into \(n\)-chromatic graphs
- Packing spanning graphs from separable families
- An approximate version of the tree packing conjecture
- Packing minor-closed families of graphs into complete graphs
- On Erdős-Sós conjecture for trees of large size
- Packing minor closed families of graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
- A blow-up lemma for approximate decompositions
- Packing trees of unbounded degrees in random graphs
- Packing trees into complete \(k\)-partite graph
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- Packing paths in Steiner triple systems
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Problems close to my heart
- Perfectly packing graphs with bounded degeneracy and many leaves
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Graph and hypergraph packing
- Regular decomposition of the edge set of a graph with applications
- Seven largest trees pack
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
- Packing large balanced trees into bipartite graphs
- Ascending subgraph decomposition
- Ringel's tree packing conjecture in quasirandom graphs
- A special case of the tree packing conjecture
- Packing sequences
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170743)
