Chordal digraphs

DOI10.1007/978-3-642-11409-0_24MaRDI QIDQ5851112zbMATH OpenOpenAlexFDO

Authors Daniel Meister, Jan Arne Telle

Publication date 21 January 2010

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11409-0_24

zbMATH Keywords

algorithmic graph theorychordal digraphschordal graphsdirected graphsGaussian eliminationperfect elimination digraphssparse linear systemstriangulated graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Chordal digraphs
• Strict chordal digraphs viewed as graphs with distinguished edges
• scientific article; zbMATH DE number 1011066
• scientific article; zbMATH DE number 554762
• An efficient representation of chordal graphs

Cited in

(13)

• Adamant digraphs
• Strict chordal digraphs viewed as graphs with distinguished edges
• Semilattice polymorphisms and chordal graphs
• Digraphs of bounded elimination width
• Fuzzy chordal graphs and its properties
• Spelled Heptachords
• On hyper-chordal graphs
• scientific article; zbMATH DE number 653261 (Why is no real title available?)
• Unit and proper bitolerance digraphs
• scientific article; zbMATH DE number 1011066 (Why is no real title available?)
• scientific article; zbMATH DE number 1404129 (Why is no real title available?)
• scientific article; zbMATH DE number 6736252 (Why is no real title available?)
• Semi-strict chordality of digraphs

This page was built for publication: Chordal digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5851112)