{
  "id": "1611.03244",
  "version": "v1",
  "published": "2016-11-10T10:29:01.000Z",
  "updated": "2016-11-10T10:29:01.000Z",
  "title": "A $\\overrightarrow{P_{3}}$-decomposition of tournaments and bipartite digraphs",
  "authors": [
    "Fangxia Wang",
    "Baoyindureng Wu",
    "Xinhui An"
  ],
  "comment": "12 pages, 3 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "A $\\overrightarrow{P_{3}}$-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 $\\overrightarrow{P_{3}}$-decomposition. This solves a problem posed by Diwan ($\\overrightarrow{P_{3}}$-decomposition of directed graphs, Discrete Appl. Math., http:// dx.doi.org/10.1016/j.dam.2016.01.039.).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-11-10T10:29:01.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "decomposition",
      "tournament",
      "directed graph",
      "discrete appl",
      "characterization"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}