Boundary classes of graphs for the dominating set problem
Authors:
- Vladimir E AlekseevVAVladimir E Alekseev
- Dmitry V KorobitsynDKDmitry V Korobitsyn
- Vadim V LozinVLVadim V Lozin
- 1 August 2004
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 285 (1-3) , 1-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On easy and hard hereditary classes of graphs with respect to the independent set problemDiscrete Applied Mathematics, 2003
- An upper bound on the number of cliques in a graphNetworks, 1993
- On the complexity of domination number determination in monogenic classes of graphsDiscrete Mathematics and Applications, 1992
- Computing independent sets in graphs with large girthDiscrete Applied Mathematics, 1992
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977