Pages that link to "Item:Q1090341"
From MaRDI portal
The following pages link to Two theorems on packings of graphs (Q1090341):
Displaying 24 items.
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- On packing bipartite graphs (Q1200276) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- Packing graphs in their complements (Q1584285) (← links)
- Packing without some pieces (Q1630682) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Sparse graphs of girth at least five are packable (Q1759402) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Packing a tree of order \(p\) with a \((p,p+1)\)-graph (Q1873645) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- A note on packing graphs without cycles of length up to five (Q2380220) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- Two theorems on graphs (Q2653309) (← links)
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge (Q2853340) (← links)
- The packing number and Laplacian spectrum of a graph (Q2935367) (← links)
- Packing a tree with a graph of the same size (Q3691689) (← links)
- (Q4206778) (← links)
- (Q4288177) (← links)
- Incidence dimension and 2-packing number in graphs (Q5034794) (← links)
- An Improvement in the Two-packing Bound Related to Vizing's Conjecture (Q5119802) (← links)
- A note on packing of two copies of a hypergraph (Q5444055) (← links)
- On Two Conjectures on Packing of Graphs (Q5704386) (← links)
- A short proof that the list packing number of any graph is well defined (Q6091812) (← links)
