Abstract
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed graphs. Several structural properties of chordal graphs that are crucial for algorithmic applications carry over to the directed setting, including notions like simplicial vertices, perfect elimination orderings, and characterisation by forbidden subgraphs resembling chordless cycles. Moreover, just as chordal graphs are related to treewidth, the chordal digraphs will be related to Kelly-width. Chordal digraphs coincide with the perfect elimination digraphs arising in the study of Gaussian elimination on sparse linear systems [Haskins and Rose, 1973].
This work is supported by the Research Council of Norway.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J., Gutin, G.: Digraphs. Theory, Algorithms and Applications. Springer, Heidelberg (2000)
Buneman, P.: A Characterisation of Rigid Circuit Graphs. Discrete Mathematics 9, 205–212 (1974)
Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 25, 71–76 (1961)
Gavril, F.: The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs. Journal of Combinatorial Theory (B) 16, 47–56 (1974)
Harary, F., Kabell, J.A., McMorris, F.R.: Bipartite intersection graphs. Commentationes Mathematicae Universitatis Carolinae 23, 739–745 (1982)
Haskins, L., Rose, D.J.: Toward characterization of perfect elimination digraphs. SIAM Journal on Computing 2, 217–224 (1973)
Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. Theoretical Computer Science 399, 206–219 (2008)
Kleitman, D.J.: A note on perfect elimination digraphs. SIAM Journal on Computing 3, 280–282 (1974)
Meister, D., Telle, J.A., Vatshelle, M.: Characterization and Recognition of Digraphs of Bounded Kelly-width. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 270–279. Springer, Heidelberg (2007)
Rose, D.J.: Triangulated Graphs and the Elimination Process. Journal of Mathematical Analysis and Applications 32, 597–609 (1970)
Rose, D.J., Tarjan, R.E.: Algorithmic Aspects of Vertex Elimination on Directed Graphs. SIAM Journal on Applied Mathematics 34, 176–197 (1978)
Sanyal, B.K., Sen, M.K.: New characterization of digraphs represented by intervals. Journal of Graph Theory 22, 297–303 (1996)
Walter, J.R.: Representations of Chordal Graphs as Subtrees of a Tree. Journal of Graph Theory 2, 265–267 (1978)
West, D.B.: Short proofs for interval digraphs. Discrete Mathematics 178, 287–292 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meister, D., Telle, J.A. (2010). Chordal Digraphs. In: Paul, C., Habib, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 2009. Lecture Notes in Computer Science, vol 5911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11409-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-11409-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11408-3
Online ISBN: 978-3-642-11409-0
eBook Packages: Computer ScienceComputer Science (R0)