A P₃-decomposition of tournaments and bipartite digraphs

From MaRDI portal
Publication:2357785



Abstract: A overrightarrowP3-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 overrightarrowP3-decomposition. This solves a problem posed by Diwan (overrightarrowP3-decomposition of directed graphs, Discrete Appl. Math., http:// dx.doi.org/10.1016/j.dam.2016.01.039.).












This page was built for publication: A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357785)