The following pages link to (Q4340018):
Displaying 46 items.
- Toward Żak's conjecture on graph packing (Q286756) (← links)
- Packing minor closed families of graphs (Q322346) (← links)
- Induced graph packing problems (Q604669) (← links)
- Packing sequences (Q787987) (← links)
- Packing two graphs of order n having total size at most 2n-2 (Q803166) (← links)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- Two theorems on packings of graphs (Q1090341) (← links)
- Packing smaller graphs into a graph (Q1123906) (← links)
- On packing and covering numbers of graphs (Q1185083) (← links)
- Regular packings of regular graphs (Q1349079) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
- Packing graphs: The packing problem solved (Q1378488) (← 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)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- Packing of graphs - a survey (Q1825885) (← links)
- Edge-disjoint placement of three trees (Q1922881) (← links)
- Near packings of graphs (Q1953525) (← links)
- On embedding graphs with bounded sum of size and maximum degree (Q2017040) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Packing large trees of consecutive orders (Q2374181) (← links)
- Packings in complete graphs (Q2715943) (← links)
- Graph packings (Q2816101) (← links)
- Packing of graphs and permutations (Q2816146) (← links)
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge (Q2853340) (← links)
- Labeled packings of graphs (Q2866609) (← links)
- Packing of graphic \(n\)-tuples (Q2888877) (← links)
- The packing number and Laplacian spectrum of a graph (Q2935367) (← links)
- Packing trees into planar graphs (Q3150194) (← links)
- $$\{k\}$$-Packing Functions of Graphs (Q3195342) (← links)
- How to Pack Directed Acyclic Graphs into Small Blocks (Q3434563) (← links)
- Some results on placing bipartite graphs of maximum degree two (Q3439450) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- Packing a tree with a graph of the same size (Q3691689) (← links)
- (Q4206754) (← links)
- (Q4222171) (← links)
- (Q4390611) (← links)
- On the packing of two copies of a caterpillar in its third power (Q4458973) (← links)
- On the packing numbers in graphs (Q4614038) (← links)
- Note on compact packing of a graph (Q5936030) (← links)
- On uniqueness of packing of three copies of 2-factors (Q6667292) (← links)
