The following pages link to Packing of graphs - a survey (Q1825885):
Displaying 34 items.
- Packing three copies of a tree into a complete bipartite graph (Q659792) (← links)
- The total chromatic number of graphs having large maximum degree (Q686156) (← links)
- Packing in honeycomb networks (Q714696) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- Packing of two digraphs into a transitive tournament (Q868371) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Embedding graphs of small size (Q1329826) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Embedding digraphs of small size (Q1356787) (← links)
- Packing of graphs and permutations -- a survey (Q1422441) (← links)
- On self-complementary supergraphs of (\(n,n\))-graphs (Q1773368) (← links)
- A near packing of two graphs (Q1850487) (← links)
- Packing three trees (Q1916129) (← links)
- Packing trees in complete bipartite graphs (Q2062685) (← links)
- Labeled packing of cycles and circuits (Q2118238) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Domination in certain chemical graphs (Q2263696) (← links)
- Labeled embedding of \((n, n-2)\)-graphs in their complements (Q2409792) (← links)
- Labeled 2-packings of trees (Q2514165) (← links)
- Domination parameters in coronene torus network (Q2516501) (← links)
- A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (Q2853340) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- (Q5074393) (← links)
- On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree (Q5246081) (← links)
- Placing two edge-disjoint copies of a tree into a bipartite graph (Q6105991) (← links)
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\) (Q6562431) (← links)
- On the diameters of friends-and-strangers graphs (Q6615519) (← links)
- Unstable graphs and packing into fifth power (Q6637062) (← links)
- On uniqueness of packing of three copies of 2-factors (Q6667292) (← links)
