Dominating Sets in Chordal Graphs
- 1 February 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (1), 191-199
- https://doi.org/10.1137/0211015
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A Linear Time Algorithm for Deciding Interval Graph IsomorphismJournal of the ACM, 1979
- A recognition algorithm for the intersection graphs of paths in treesDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A recognition algorithm for the intersection graphs of directed paths in directed treesDiscrete Mathematics, 1975
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962