Chordal graphs and their clique graphs
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 358-371
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Some aspects of the semi-perfect eliminationDiscrete Applied Mathematics, 1991
- A Fast Algorithm for Reordering Sparse Matrices for Parallel FactorizationSIAM Journal on Scientific and Statistical Computing, 1989
- On the tree representation of chordal graphsJournal of Graph Theory, 1988
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957