Jing Huang, Ying Ying Ye
Published 2022-09-13Version 1
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.
Comments: 12 pages, 2 figures. arXiv admin note: text overlap with arXiv:2008.03568
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
On the Djoković-Winkler relation and its closure in subdivisions of fullerenes, triangulations, and chordal graphs
Edge-Erasures and Chordal Graphs
![QR code for arXiv:2209.06271 [math.CO]](http://oss.arxitics.com/images/favicon.svg)