{
  "id": "2209.06271",
  "version": "v1",
  "published": "2022-09-13T19:22:45.000Z",
  "updated": "2022-09-13T19:22:45.000Z",
  "title": "Semi-chordality of digraphs",
  "authors": [
    "Jing Huang",
    "Ying Ying Ye"
  ],
  "comment": "12 pages, 2 figures. arXiv admin note: text overlap with arXiv:2008.03568",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "Chordal graphs are important in algorithmic graph theory. Chordal digraphs are a digraph analogue of chordal graphs and have been a subject of active studies recently. In this paper we introduce the notion of semi-strict chordal digraphs which form a class strictly between chordal digraphs and chordal graphs. We characterize semi-strict chordal digraphs by forbidden subdigraphs within the cases of locally semicomplete digraphs and weakly quasi-transitive digraphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-09-13T19:22:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "chordal graphs",
      "semi-chordality",
      "algorithmic graph theory",
      "characterize semi-strict chordal digraphs",
      "digraph analogue"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}