Semi-strict chordality of digraphs

DOI10.1007/S00373-024-02778-5MaRDI QIDQ6540642FDOQ6540642

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)

Cites Work

• Title not available (Why is that?)
• Locally semicomplete digraphs: A generalization of tournaments
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Transitiv orientierbare Graphen
• Quasi‐transitive digraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Chordal digraphs
• Toward Characterization of Perfect Elimination Digraphs
• Strict chordal and strict split digraphs
• Strict chordal digraphs viewed as graphs with distinguished edges
• Chordality of locally semicomplete and weakly quasi-transitive digraphs
• Semi-strict chordal digraphs

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)