Permutation graphs: Connected domination and Steiner trees
Authors:
- Charles J. ColbournCCCharles J. Colbourn
- Lorna K. StewartLSLorna K. Stewart
- 14 December 1990
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 86 (1-3) , 179-189
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- Steiner trees, connected domination and strongly chordal graphsNetworks, 1985
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- A linear algorithm for the domination number of a series-parallel graphDiscrete Applied Mathematics, 1983
- Independent domination in chordal graphsOperations Research Letters, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971