Domination in convex and chordal bipartite graphs
- 1 December 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (5) , 231-236
- https://doi.org/10.1016/0020-0190(90)90147-p
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The NP-completeness of steiner tree and dominating set for chordal bipartite graphsTheoretical Computer Science, 1987
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976