A P3^sub 3^-decomposition of tournaments and bipartite digraphs

A ...-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 ...-decomposition. This solves a problem posed by Diwan (2016).

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 226; p. 158
Main Authors Wang, Fangxia, Wu, Baoyindureng, An, Xinhui
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier BV 31.07.2017
Subjects
Combinatorics
Decomposition
Graph theory
Mathematics
Symmetry
Online AccessGet full text

Cover

More Information
Summary:A ...-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 ...-decomposition. This solves a problem posed by Diwan (2016).
ISSN:0166-218X
1872-6771