Chordal digraphs

DOI10.1016/j.tcs.2012.06.019zbMath1256.05088OpenAlexW2914177887MaRDI QIDQ1929220

Jan Arne Telle, Daniel Meister

Publication date: 7 January 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.019

zbMATH Keywords

treewidthchordal graphsstructural propertiesKelly-widthperfect elimination digraphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Semi-strict chordal digraphs, Strict chordal and strict split digraphs, Chordality of locally semicomplete and weakly quasi-transitive digraphs, Strong Chordality of Graphs with Possible Loops

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
• On rigid circuit graphs
• Digraph measures: Kelly decompositions, games, and orderings
• Recognizing digraphs of Kelly-width 2
• Short proofs for interval digraphs
• A characterisation of rigid circuit graphs
• Triangulated graphs and the elimination process
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Characterization and Recognition of Digraphs of Bounded Kelly-width
• Representations of chordal graphs as subtrees of a tree
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Toward Characterization of Perfect Elimination Digraphs