A near packing of two graphs
From MaRDI portal
Publication:1850487
Recommendations
Cites work
Cited in
(19)- On a packing problem of Alon and Yuster
- Ore-type graph packing problems
- Labeled packings of graphs
- Packing of graphs with small product of sizes
- A list version of graph packing
- Packing graphs of bounded codegree
- Efficient graph packing via game colouring
- Packing two graphs of even girth 10
- Navigating between packings of graphic sequences
- On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Near packings of graphs
- Packing degenerate graphs
- A note on careful packing of a graph
- A note on packing of graphic \(n\)-tuples
- An Ore-type analogue of the Sauer-Spencer theorem
- Near packings of two graphs
- On a graph packing conjecture by Bollobás, Eldridge and Catlin
- Packing \(d\)-degenerate graphs
This page was built for publication: A near packing of two graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850487)