Article ID Journal Published Year Pages File Type
4949623 Discrete Applied Mathematics 2017 8 Pages PDF
Abstract
A P3⃗-decomposition of a directed graph D is a partition of the arcs of D into directed paths of length 2. In this paper, we give a characterization for a tournament and a bipartite digraph admitting a P3⃗-decomposition. This solves a problem posed by Diwan (2016).
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , ,