Total domination in interval graphs
- 17 April 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 22 (4) , 171-174
- https://doi.org/10.1016/0020-0190(86)90022-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- Finding Hamiltonian circuits in interval graphsInformation Processing Letters, 1985
- On the Algorithmic Complexity of Total DominationSIAM Journal on Algebraic Discrete Methods, 1984
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962