Chordal digraphs
type: Item
instance of: scholarly article
title: Chordal digraphs
zbMATH Open document ID: 1256.05088
author: Daniel Meister
author: Jan Arne Telle
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A24
zbMATH DE Number: 6122457
zbMATH Keywords: perfect elimination digraphs
zbMATH Keywords: Kelly-width
zbMATH Keywords: treewidth
zbMATH Keywords: chordal graphs
zbMATH Keywords: structural properties
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.019
OpenAlex ID: W2914177887
cites work: Q4288578
cites work: A characterisation of rigid circuit graphs
cites work: On rigid circuit graphs
cites work: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q3663338
cites work: Toward Characterization of Perfect Elimination Digraphs
cites work: Digraph measures: Kelly decompositions, games, and orderings
cites work: Characterization and Recognition of Digraphs of Bounded Kelly-width
cites work: Recognizing digraphs of Kelly-width 2
cites work: Triangulated graphs and the elimination process
cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs
cites work: Q4892352
cites work: Representations of chordal graphs as subtrees of a tree
cites work: Short proofs for interval digraphs
DOI: 10.1016/J.TCS.2012.06.019
description: scientific article; zbMATH DE number 6122457