Semi-strict chordality of digraphs
From MaRDI portal
Publication:6540642
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Chordal digraphs
- Chordality of locally semicomplete and weakly quasi-transitive digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- Quasi‐transitive digraphs
- Semi-strict chordal digraphs
- Strict chordal and strict split digraphs
- Strict chordal digraphs viewed as graphs with distinguished edges
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Toward Characterization of Perfect Elimination Digraphs
- Transitiv orientierbare Graphen
This page was built for publication: Semi-strict chordality of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540642)