Pages that link to "Item:Q803166"
From MaRDI portal
The following pages link to Packing two graphs of order n having total size at most 2n-2 (Q803166):
Displaying 13 items.
- Packing of graphs with small product of sizes (Q958696) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Packing a tree of order \(p\) with a \((p,p+1)\)-graph (Q1873645) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- Packing of graphs and permutations (Q2816146) (← links)
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge (Q2853340) (← links)
- A note on uniquely embeddable graphs (Q4222377) (← links)
- Note on compact packing of a graph (Q5936030) (← links)
- k-Planar Placement and Packing of Δ-Regular Caterpillars (Q6066468) (← links)
- Three edge-disjoint plane spanning paths in a point set (Q6560157) (← links)