Two theorems on packings of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3771651 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Embedding graphs in their complements
- Every (p,p-2) graph is contained in its complement
- Packing a tree with a graph of the same size
- Packings of graphs and applications to computational complexity
- Subgraphs of graphs. I
Cited in
(30)- scientific article; zbMATH DE number 731858 (Why is no real title available?)
- On asymptotic packing of convex geometric and ordered graphs
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- Packing a tree of order \(p\) with a \((p,p+1)\)-graph
- Packing without some pieces
- Two theorems on graphs
- Packing of any set of graphs into a graceful / harmonious / elegant graph.
- Packing two graphs of even girth 10
- Incidence dimension and 2-packing number in graphs
- scientific article; zbMATH DE number 554182 (Why is no real title available?)
- On asymptotic packing of geometric graphs
- scientific article; zbMATH DE number 4127266 (Why is no real title available?)
- On packing bipartite graphs
- On Two Conjectures on Packing of Graphs
- Packing of graphs - a survey
- The packing number and Laplacian spectrum of a graph
- A short proof that the list packing number of any graph is well defined
- Packing two graphs of order n having total size at most 2n-2
- Sparse graphs of girth at least five are packable
- Packing graphs in their complements
- A note on packing graphs without cycles of length up to five
- Packing three copies of a tree into its sixth power
- A note on careful packing of a graph
- Packing a tree with a graph of the same size
- Labeled embedding of \((n, n-2)\)-graphs in their complements
- scientific article; zbMATH DE number 790422 (Why is no real title available?)
- A note on packing of two copies of a hypergraph
- Packing of graphs and permutations -- a survey
- An Improvement in the Two-packing Bound Related to Vizing's Conjecture
- On packable digraphs
This page was built for publication: Two theorems on packings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090341)
