Packing a number of copies of a \(( p , q )\)-graph
From MaRDI portal
Publication:2217483
DOI10.1016/j.dam.2020.11.010zbMath1454.05099arXiv2002.01266OpenAlexW3107848556MaRDI QIDQ2217483
Publication date: 29 December 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01266
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A list version of graph packing
- A note on \(k\)-placeable graphs
- Edge disjoint placement of graphs
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
- Packing trees in complete graphs
- Packing three copies of a tree into a complete graph
- Embedding (p,p - 1) graphs in their complements
- Packings of graphs and applications to computational complexity
- On packing trees into complete bipartite graphs
- Packing of graphs and permutations -- a survey
- Packing two graphs of even girth 10
- Packing of graphs - a survey
- Some remarks on packing trees
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- Optimal packings of bounded degree trees
- Triple placement of graphs
- Packing large trees of consecutive orders
- Packing trees into \(n\)-chromatic graphs
- Packing \(d\)-degenerate graphs
- On a packing problem of Alon and Yuster
- Every (p,p-2) graph is contained in its complement
- Embedding Arbitrary Graphs of Maximum Degree Two
- Generalizations of the tree packing conjecture
- Packing of three copies of a graph
- Packing Graphs of Bounded Codegree
- On the Tree Packing Conjecture
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- On the packing of three graphs
This page was built for publication: Packing a number of copies of a \(( p , q )\)-graph
