The following pages link to Packing of graphs - a survey (Q1825885):
Displayed 15 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)
- 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)
- A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (Q2853340) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)