On chordal digraphs and semi-strict chordal digraphs
Chordal graphs are an important class of perfect graphs. The beautiful theory surrounding their study varies from natural applications to elegant characterizations in terms of forbidden subgraphs, subtree representations, vertex orderings, and to linear time recognition algorithms. Haskins and Ro...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/11083 |