The tile packing problem is a challenging combinatorial puzzle based on tiles with colored edges or colored corners. In its different incarnations, the puzzle gives rise to a number of interesting problems. In this paper, we sketch the background of the tile packing problem and present solutions to the puzzle. We hope that this work will stimulate further interest in this puzzle amongst readers...

objective: to evaluate the efficacy of modified perihepatic packing (mphp) in reducing the rate of re-bleeding rate after packing removal. methods: this was an experimental study being performed in shiraz animal laboratory. high grade liver parenchymal injury was induced in 30 transgenic australian rabbits which were then divided into two groups. group a (control) included 14 and group b (exper...

The packing chromatic number χρ(G) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least i+ 1. It is proved that in the class of subcubic graphs the packing chromatic number is bigger than 13, thus answering an open problem from [Gastineau, Togni, S-packing colorings of cubic graphs, Discrete M...

ii

Generalizing Kaneko’s long path packing problem, Hartvigsen, Hell and Szabó consider a new type of undirected graph packing problem, called the k-piece packing problem. A k-piece is a simple, connected graph with highest degree exactly k so in the case k = 1 we get the classical matching problem. They give a polynomial algorithm, a Tutte-type characterization and a Berge-type minimax formula fo...

the main issues in nasal surgery are to stabilize the nose in the good position after surgery and preserve the cartilages and bones in the favorable situation and reduce the risk of deviation recurrence. also it is necessary to avoid the synechia formation, nasal valve narrowing, hematoma and bleeding. due to the above mentioned problems and in order to solve and minimize them nasal packing, na...