Weighted independent perfect domination on cocomparability graphs
- 8 December 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 63 (3) , 215-222
- https://doi.org/10.1016/0166-218x(94)00067-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Domatic Number Problem in Interval GraphsSIAM Journal on Discrete Mathematics, 1990
- An Incremental Linear-Time Algorithm for Recognizing Interval GraphsSIAM Journal on Computing, 1989
- On the domatic number of internal graphsInformation Processing Letters, 1988
- Total Domination and Irredundance in Weighted Interval GraphsSIAM Journal on Discrete Mathematics, 1988
- A unified approach to domination problems on interval graphsInformation Processing Letters, 1988
- Total domination in interval graphs revisitedInformation Processing Letters, 1988
- Total domination in interval graphsInformation Processing Letters, 1986
- Total domination in interval graphsInformation Processing Letters, 1986
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Perfect codes in graphsJournal of Combinatorial Theory, Series B, 1973