Decomposition of complete tripartite graphs into cycles and paths of length three

Let $C_{k}$ and $P_{k}$ denote a cycle and a path on $k$ vertices, respectively. In this paper, we obtain necessary and sufficient conditions for the decomposition of $K_{{r},{s},{t}}$ into $p$ copies of $C_{3}$ and $q$ copies of $P_{4}$ for all possible values of $p$, $q\geq0$

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in which each destination point can be reached from each starting point by choosing the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygons with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles, but can be solved optimally for trees in polynomial time. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.Comment: full version of a paper appearing in ISAAC 201

Decompositions of some classes of regular graphs into cycles and paths of length eight

Let $C_{k}$ (resp. $P_{k}$) denote the cycle (resp. path) of length $k$. In this paper, we examine the necessary and sufficient conditions for the existence of a $(8; p, q)$-decomposition of tensor product and wreath product of complete graphs

Decomposing complete equipartite graphs into short odd cycles

In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both odd and shot relative to the number of parts

Cyclic cycle systems of the complete multipartite graph

In this paper, we study the existence problem for cyclic $\ell$-cycle decompositions of the graph $K_m[n]$, the complete multipartite graph with $m$ parts of size $n$, and give necessary and sufficient conditions for their existence in the case that $2\ell \mid (m-1)n$