The following pages link to A near packing of two graphs (Q1850487):
Displaying 16 items.
- A list version of graph packing (Q284763) (← links)
- A note on packing of graphic \(n\)-tuples (Q501040) (← links)
- Near packings of two graphs (Q512568) (← links)
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- Packing of graphs with small product of sizes (Q958696) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Near packings of graphs (Q1953525) (← links)
- Navigating between packings of graphic sequences (Q2026343) (← links)
- Packing degenerate graphs (Q2324574) (← links)
- An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
- Packing \(d\)-degenerate graphs (Q2464154) (← links)
- On a packing problem of Alon and Yuster (Q2629291) (← links)
- Labeled packings of graphs (Q2866609) (← links)
- Packing Graphs of Bounded Codegree (Q4962588) (← links)
- On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree (Q5246081) (← links)