Semi-strict chordality of digraphs

DOI10.1007/S00373-024-02778-5MaRDI QIDQ6540642zbMATH OpenFDO

Authors Jing Huang, Ying Ying Ye

Publication date 17 May 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

locally semicomplete digraphchordal graphchordal digraphknotting graphstrict chordal digraphforbidden subdigraph characterizationweakly quasi-transitive digraphsemi-strict chordal digraph

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Numerical linear algebra (65Fxx)

Recommendations

• Chordality of locally semicomplete and weakly quasi-transitive digraphs
• Chordal digraphs
• Strict chordal digraphs viewed as graphs with distinguished edges
• Chordal digraphs
• On strictly chordality-\(k\) graphs

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)