{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T01:37:24Z","timestamp":1783474644354,"version":"3.55.0"},"reference-count":403,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90365-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"257-277","source":"Crossref","is-referenced-by-count":97,"title":["Bibliography on domination in graphs and some basic definitions of domination parameters"],"prefix":"10.1016","volume":"86","author":[{"given":"S.T.","family":"Hedetniemi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.C.","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(79)90083-9","article-title":"Bounds for the covering number of a graph","volume":"25","author":"Abbott","year":"1979","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/0012-365X(90)90365-O_BIB2","first-page":"471","article-title":"The strong domination number of a graph and related concepts","volume":"14","author":"Acharya","year":"1980","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB3","unstructured":"B.D. Acharya and H.B. Walikar, Bounds on the size of a graph having unique minimum dominating set, manuscript, undated."},{"key":"10.1016\/0012-365X(90)90365-O_BIB4","unstructured":"B.D. Acharya and H.B. Walikar, Indominable graphs cannot be characterized by a finite family of forbidden subgraphs, manuscript, undated."},{"issue":"5","key":"10.1016\/0012-365X(90)90365-O_BIB5","first-page":"1","article-title":"On graphs having unique minimum dominating sets","volume":"8","author":"Acharya","year":"1979","journal-title":"Graph Theory Newsletter"},{"key":"10.1016\/0012-365X(90)90365-O_BIB6","author":"Ahrens","year":"1901","journal-title":"Mathematishe Unterhaltungen und Spiele"},{"key":"10.1016\/0012-365X(90)90365-O_BIB7","first-page":"303","article-title":"Some theorems on coverings","volume":"5","author":"Aigner","year":"1970","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(90)90365-O_BIB8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0012-365X(78)90105-X","article-title":"On domination and independent domination numbers of a graph","volume":"23","author":"Allan","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB9","series-title":"Proceedings Ninth S.E. Conference on Combinatorics, Graph Theory and Computing","first-page":"43","article-title":"On domination and some related topics in graph theory","author":"Allan","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(84)90145-6","article-title":"A note on total domination","volume":"49","author":"Allan","year":"1984","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230070306","article-title":"On kernels in strongly connected graphs","volume":"7","author":"Anciaux-Mundeleer","year":"1977","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.3190020104","article-title":"Graphs with unique maximal clumpings","volume":"2","author":"Andreas","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB13","first-page":"3","article-title":"Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices","volume":"11","author":"Arnautov","year":"1974","journal-title":"Prikl. Mat. i Programmirovanie Vyp."},{"key":"10.1016\/0012-365X(90)90365-O_BIB14","first-page":"3","article-title":"The exterior stability number of a graph","volume":"20","author":"Arnautov","year":"1972","journal-title":"Diskret. Analiz"},{"key":"10.1016\/0012-365X(90)90365-O_BIB15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0012-365X(90)90365-O_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial K-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB17","unstructured":"P. Ash, Two sufficient conditions for the existence of hamilton cycles in bipartite graphs, undated manuscript."},{"key":"10.1016\/0012-365X(90)90365-O_BIB18","series-title":"Progress in Graph Theory, Waterloo, Ont., 1982","first-page":"81","article-title":"Dominating cycles in bipartite graphs","author":"Ash","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB19","series-title":"Tech. Rept. CC-86-11","article-title":"An efficient algorithm for maxdominance, with applications","author":"Atallah","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB20","first-page":"265","article-title":"Approximation algorithms for NP-complete problems on planar graphs","author":"Baker","year":"1983","journal-title":"24th Annual Symposium on the Foundations of Computer Science"},{"key":"10.1016\/0012-365X(90)90365-O_BIB21","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","article-title":"On the set covering problem","volume":"20","author":"Balas","year":"1972","journal-title":"Oper. Res."},{"key":"10.1016\/0012-365X(90)90365-O_BIB22","series-title":"Mathematical Recreations and Problems","author":"Ball","year":"1892"},{"key":"10.1016\/0012-365X(90)90365-O_BIB23","first-page":"83","article-title":"Efficient near-domination of grid graphs","volume":"58","author":"Bange","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB24","series-title":"Proceedings Ninth S.E. Conference on Combinatorics, Graph Theory and Computing","first-page":"101","article-title":"A constructive characterization of trees with two disjoint minimum dominating sets","author":"Bange","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB25","series-title":"Tech. Rept. SAND78-1087J","article-title":"Disjoint dominating sets in trees","author":"Bange","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB26","series-title":"Applications of Discrete Mathematics, SIAM","first-page":"189","article-title":"Efficient dominating sets in graphs","author":"Bange","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB27","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0020-0190(82)90021-7","article-title":"Complexity of finding k-path-free dominating sets in graphs","volume":"14","author":"Bar-Yehuda","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB28","author":"Barefoot","year":"1988","journal-title":"What is the difference between \u03b1 and \u03b1\u2032 of a cubic graph?"},{"issue":"2\u20133","key":"10.1016\/0012-365X(90)90365-O_BIB29","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(83)90085-7","article-title":"Domination alteration sets in graphs","volume":"47","author":"Bauer","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02825085","article-title":"On the characterization of \u201cdomistable\u201d graphs (Italian; English summary)","volume":"27","author":"Benedetti","year":"1981","journal-title":"Ann. Univ. Ferrara Sez. VII (NS)"},{"key":"10.1016\/0012-365X(90)90365-O_BIB31","first-page":"1","article-title":"Linear separation of dominating sets in graphs","volume":"3","author":"Benzaken","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB32","unstructured":"C. Benzaken and P.L. Hammer, On some open problems regarding dominating sets in graphs, manuscript."},{"key":"10.1016\/0012-365X(90)90365-O_BIB33","first-page":"303","article-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(90)90365-O_BIB34","first-page":"6","article-title":"Nouvelles extensions du noyau d'un graphe et ses applications en theorie des jeux","volume":"6","author":"Berge","year":"1973","journal-title":"Publ. Econometriques"},{"key":"10.1016\/0012-365X(90)90365-O_BIB35","first-page":"40","article-title":"Theory of Graphs and its Applications","author":"Berge","year":"1962"},{"key":"10.1016\/0012-365X(90)90365-O_BIB36","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90365-O_BIB37","first-page":"117","article-title":"Why certain subgraph computations require only linear time","author":"Bern","year":"1985","journal-title":"26th Annual IEEE Symposium on the Foundations of Computer Science"},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB38","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0401031","article-title":"A class of polynomially solvable set covering problems","volume":"1","author":"Bertolazzi","year":"1988","journal-title":"SIAM, J. Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB39","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","article-title":"Dominating sets for split and bipartite graphs","volume":"19","author":"Bertossi","year":"1984","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB40","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(86)90112-2","article-title":"Total domination in interval graphs","volume":"23","author":"Bertossi","year":"1986","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB41","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0401032","article-title":"Total domination and irredundance in weighted interval graphs","volume":"1","author":"Bertossi","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB42","series-title":"Proceedings Eighth S.E. Conference on Combinatorics, Graph Theory and Computing","first-page":"321","article-title":"Independent domination in trees","author":"Beyer","year":"1977"},{"issue":"8","key":"10.1016\/0012-365X(90)90365-O_BIB43","first-page":"641","article-title":"Bornes inf\u00e9rieures et sup\u00e9rieures du poids et du cardinal de tout ensemble stable maximal d'un graphe (upper and lower bounds for the weight and c ardinality of every maximal stable set of a graph)","volume":"29","author":"Billionnet","year":"1984","journal-title":"Rev. Roumaine Math. Pures Appl."},{"issue":"149","key":"10.1016\/0012-365X(90)90365-O_BIB44","first-page":"3","article-title":"An estimate of the external stability number of a graph without suspenced vertices (in Russian)","volume":"10","author":"Blank","year":"1973","journal-title":"Prikl. Mat. i Programmirovanie Vyp."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB45","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB46","series-title":"Tech. Rept. DM-276-IR","article-title":"On the domination number and minimum degree of a graph","author":"Bollob\u00e1s","year":"1983"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB47","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(84)90118-3","article-title":"On the irredundance number and maximum degree of a graph","volume":"49","author":"Bollob\u00e1s","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB48","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(90)90352-I","article-title":"On generalised minimal domination parameters for paths","volume":"86","author":"Bollob\u00e1s","year":"1990","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB49","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1112\/jlms\/s2-16.3.403","article-title":"Uniquely partitionable graphs","volume":"2","author":"Bollob\u00e1s","year":"1977","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90365-O_BIB50","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(87)90029-X","article-title":"A sufficient condition for dominating cycles","volume":"76","author":"Bondy","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB51","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(85)90025-3","article-title":"Dominating sets and domatic number of circular arc graphs","volume":"12","author":"Bonuccelli","year":"1985","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB52","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90365-O_BIB53","first-page":"3","article-title":"On graphs with minimaximal kernels, \u2217","volume":"13","author":"Borowiecki","year":"1977","journal-title":"17 Ser. Stud. i Materialy"},{"key":"10.1016\/0012-365X(90)90365-O_BIB54","series-title":"Contributions to graph theory and its applications","first-page":"33","article-title":"On the stable and absorbent sets of hypergraphs","author":"Borowiecki","year":"1977"},{"key":"10.1016\/0012-365X(90)90365-O_BIB55","series-title":"Tech. Rept. N\/88\/10","article-title":"Classes of bipartite graphs related to chordal graphs and domination of one colour class by the other","author":"Brandst\u00e4dt","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB56","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","article-title":"On domination problems for permutation and other graphs","volume":"54","author":"Brandst\u00e4dt","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB57","series-title":"Tech. Rept. N\/84\/80","article-title":"On the restriction of some NP-complete graph problems to permutation graphs","author":"Brandst\u00e4dt","year":"1984"},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB58","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230180304","article-title":"Vertex domination-critical graphs","volume":"18","author":"Brigham","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0012-365X(90)90365-O_BIB59","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(90)90355-L","article-title":"Factor domination in graphs","volume":"86","author":"Brigham","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB60","first-page":"121","article-title":"Neighborhood numbers, new invariants of undirected graphs","volume":"53","author":"Brigham","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB61","first-page":"167","article-title":"On the vertex-independence number and star decomposition of graphs","volume":"20","author":"Caro","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB62","first-page":"37","article-title":"Independent sets and kernels in graphs and hypergraphs","volume":"4","author":"Cazanescu","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB63","series-title":"Ph.D. Thesis","article-title":"k-domination and graph covering problems","author":"Chang","year":"1982"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB64","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","article-title":"Labelling algorithms for domination problems in sunfree chordal graphs","volume":"22","author":"Chang","year":"1988","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB65","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0167-6377(89)90034-5","article-title":"Total domination in block graphs","volume":"8","author":"Chang","year":"1989","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB66","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0606012","article-title":"Covering, packing and generalized perfection","volume":"6","author":"Chang","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"6","key":"10.1016\/0012-365X(90)90365-O_BIB67","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/0167-6377(82)90024-4","article-title":"R-domination of block graphs","volume":"1","author":"Chang","year":"1982","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB68","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability on sun-free chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(90)90365-O_BIB69","article-title":"The k-domination and k-stability problems on graphs","volume":"540","author":"Chang","year":"1982"},{"key":"10.1016\/0012-365X(90)90365-O_BIB70","article-title":"On the kernels of graphs","author":"Chao","year":"1962","journal-title":"IBM Research Rept. RC-685"},{"key":"10.1016\/0012-365X(90)90365-O_BIB71","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","article-title":"On the computational complexity of upper fractional domination","volume":"27","author":"Cheston","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB72","first-page":"105","article-title":"Simplicial graphs","volume":"67","author":"Cheston","year":"1988","journal-title":"Congr. Numer."},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB73","first-page":"73","article-title":"On the minimum dominating pair number of a class of graphs","volume":"1","author":"Chung","year":"1982","journal-title":"Caribbean J. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB74","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(90)90360-T","article-title":"The discipline number of a graph","volume":"86","author":"Chv\u00e1tal","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB75","series-title":"Hypergraph Seminar","article-title":"Every directed graph has a semikernel","volume":"411","author":"Chv\u00e1tal","year":"1974"},{"key":"10.1016\/0012-365X(90)90365-O_BIB76","first-page":"189","article-title":"A conjecture on dominating cycles","volume":"47","author":"Clark","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB77","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB78","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(90)90344-H","article-title":"Chessboard domination problems","volume":"86","author":"Cockayne","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB79","series-title":"Theory and Applications of Graphs in America's Bicentennial Year","first-page":"141","article-title":"Domination in undirected graphs \u2014 a survey","author":"Cockayne","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB80","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/net.3230100304","article-title":"Total domination in graphs","volume":"10","author":"Cockayne","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0012-365X(90)90365-O_BIB81","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(81)90268-5","article-title":"Contributions to the theory of domination, independence and irredundance in graphs","volume":"33","author":"Cockayne","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB82","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/jgt.3190090414","article-title":"An upper bound for the k-domination number of a graph","volume":"9","author":"Cockayne","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB83","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(86)90139-1","article-title":"Domination parameters for the bishops graph","volume":"58","author":"Cockayne","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB84","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB85","first-page":"217","article-title":"Bounds for the domination number of grid graphs","volume":"47","author":"Cockayne","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB86","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0012-365X(76)90026-1","article-title":"Disjoint independent dominating sets in graphs","volume":"15","author":"Cockayne","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB87","series-title":"Proceedings Fifth S.E. Conference on Combinatorics, Graph Theroy and Computing","first-page":"471","article-title":"Independence graphs","author":"Cockayne","year":"1974"},{"key":"10.1016\/0012-365X(90)90365-O_BIB88","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0097-3165(86)90012-9","article-title":"On the diagonal queens domination problem","volume":"42","author":"Cockayne","year":"1986","journal-title":"J. Combin. Theory Ser. A"},{"issue":"11","key":"10.1016\/0012-365X(90)90365-O_BIB89","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/TCS.1975.1083994","article-title":"Optimal domination in graphs","volume":"22","author":"Cockayne","year":"1975","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0012-365X(90)90365-O_BIB90","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB91","doi-asserted-by":"crossref","first-page":"461","DOI":"10.4153\/CMB-1978-079-5","article-title":"Properties of hereditary hypergraphs and middle graphs","volume":"21","author":"Cockayne","year":"1978","journal-title":"Canad. Math. Bull"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB92","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0095-8956(79)90044-3","article-title":"Matchings and transversals in hypergraphs, domination and independence in trees","volume":"26","author":"Cockayne","year":"1979","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB93","series-title":"Tech. Rept. DM-370-IR","article-title":"Inequalities concerning dominating sets in graphs","author":"Cockayne","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB94","series-title":"Res. Rept. 36\/86","article-title":"On the product of k-minimal domination numbers of a graph and its complement","author":"Cockayne","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB95","doi-asserted-by":"crossref","unstructured":"E.J. Cockayne and C.M. Mynhardt, On the product of upper irredundance numbers of a graph and its complement, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(89)90304-X"},{"key":"10.1016\/0012-365X(90)90365-O_BIB96","author":"Cockayne","year":"1988","journal-title":"The sequence of upper and lower domination, independence and irredundance numbers of a graph"},{"key":"10.1016\/0012-365X(90)90365-O_BIB97","first-page":"94","article-title":"Computation of dominating partitions","volume":"15","author":"Cockayne","year":"1977","journal-title":"INFOR."},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB98","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01864158","article-title":"On the independent queens covering problem","volume":"4","author":"Cockayne","year":"1988","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB99","series-title":"Tech. Rept. DM-175-IR","article-title":"Contributions to the theory of domination, independence and irredundance in graphs","author":"Cockayne","year":"1979"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB100","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-6377(85)90044-6","article-title":"Finding minimum dominating cycles in permutation graphs","volume":"4","author":"Colbourn","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB101","first-page":"135","volume":"56","author":"Colbourn","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB102","first-page":"107","article-title":"Dominating cycles in series-parallel graphs","volume":"19","author":"Colbourn","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB103","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(90)90359-P","article-title":"Permutation graphs: connected domination and Steiner trees","volume":"86","author":"Colbourn","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB104","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/0608044","article-title":"A dynamic programming approach to the dominating set problem on k-trees","volume":"8","author":"Corneil","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(90)90365-O_BIB105","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB106","first-page":"249","article-title":"Cographs: recognition, application and algorithms","volume":"43","author":"Corneil","year":"1984","journal-title":"Congr. Numer."},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB107","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90365-O_BIB108","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","article-title":"Dominating sets in perfect graphs","volume":"86","author":"Corneil","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB109","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","article-title":"Dominating cliques in graphs","volume":"86","author":"Cozzens","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB110","series-title":"Proceedings Third Colloquium On Operations Research","first-page":"55","article-title":"On stables in graphs","author":"Croitoru","year":"1979"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB111","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(83)90091-1","article-title":"Perfect stables in graphs","volume":"17","author":"Croitoru","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB112","series-title":"Tech. Rept. R.147","article-title":"Cross graphs, Steiner trees and connected domination","author":"D'Atri","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB113","article-title":"Irredundance number versus domination number","author":"Damaschke","year":"1988","journal-title":"Forschungsergebnisse der FSU Jena"},{"key":"10.1016\/0012-365X(90)90365-O_BIB114","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1017\/S1446788700004031","article-title":"Algorithms for generalized stability numbers of tree graphs","volume":"6","author":"Daykin","year":"1966","journal-title":"J. Austral. Math. Soc."},{"key":"10.1016\/0012-365X(90)90365-O_BIB115","series-title":"Applications de l'Analyse Mathematique an Jenudes Echecs","author":"De Jaenisch","year":"1862"},{"key":"10.1016\/0012-365X(90)90365-O_BIB116","series-title":"Report #71","article-title":"Fast Turing reductions between problems in NP; Chapter 4: Reductions between NP-complete problems","author":"Dewdney","year":"1981"},{"key":"10.1016\/0012-365X(90)90365-O_BIB117","series-title":"Ph.D. Thesis","article-title":"Variations of colorings, coverings and packings of graphs","author":"Domke","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB118","first-page":"227","article-title":"Fractional packings, coverings and irredundance in graphs","volume":"66","author":"Domke","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB119","first-page":"259","article-title":"Generalized packings and coverings of graphs","volume":"62","author":"Domke","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB120","author":"Domke","year":"1988","journal-title":"Relationships between integer and fractional parameters of graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB121","first-page":"71","article-title":"On Hadwiger's number and the stability number","volume":"13","author":"Duchet","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB122","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","article-title":"Bottleneck extrema","volume":"8","author":"Edmonds","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB123","first-page":"67","article-title":"The domination number of graphs (Russian, Armenian summary)","volume":"2","author":"Egiazaryan","year":"1983"},{"key":"10.1016\/0012-365X(90)90365-O_BIB124","first-page":"1009","article-title":"Algorithms for the detection of the minimal externally stable sets in a graph, and applications","volume":"23","author":"Ene","year":"1971","journal-title":"Stud. Cerc. Mat."},{"key":"10.1016\/0012-365X(90)90365-O_BIB125","series-title":"Tech. Rept. TR-81-13","article-title":"Applications of linear programming duality to problems involving independence and domination","author":"Farber","year":"1981"},{"key":"10.1016\/0012-365X(90)90365-O_BIB126","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB127","first-page":"3","article-title":"Domination and duality in weighted trees","volume":"33","author":"Farber","year":"1981","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB128","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB129","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","article-title":"Independent domination in chordal graphs","volume":"1","author":"Farber","year":"1982","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB130","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","article-title":"Domination in permutation graphs","volume":"6","author":"Farber","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90365-O_BIB131","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF00978378","article-title":"Partitioning trees: matching, domination and maximum diameter","volume":"10","author":"Farley","year":"1981","journal-title":"Internat. J. Comput. Info. Sciences"},{"key":"10.1016\/0012-365X(90)90365-O_BIB132","first-page":"219","article-title":"Computing the maximum order of an open irredundant set in a tree","volume":"41","author":"Farley","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB133","first-page":"47","article-title":"Senders in broadcast networks: open irredundancy in graphs","volume":"38","author":"Farley","year":"1983","journal-title":"Congr. Numer."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB134","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0095-8956(85)90040-1","article-title":"On a conjecture of Fink and Jacobson concerning k-domination and k-dependence","volume":"39","author":"Favaron","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90365-O_BIB135","first-page":"316","article-title":"A note on the open irredundance in a graph","volume":"66","author":"Favaron","year":"1988","journal-title":"Congr. Numer."},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB136","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190100402","article-title":"Stability, domination and irredundance in a graph","volume":"10","author":"Favaron","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB137","author":"Fellows","year":"1986","journal-title":"Applications of some domination-related categories of graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB138","series-title":"Ph.D. Thesis","article-title":"Encoding graphs in graphs","author":"Fellows","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB139","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"283","article-title":"n-domination in graphs","author":"Fink","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB140","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"301","article-title":"On n-domination, n-dependence and forbidden subgraphs","author":"Fink","year":"1985"},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB141","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01848079","article-title":"On graphs having domination number half their order","volume":"16","author":"Fink","year":"1985","journal-title":"Period. Math. Hungar."},{"key":"10.1016\/0012-365X(90)90365-O_BIB142","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","article-title":"The bondage number of a graph","volume":"86","author":"Fink","year":"1990","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB143","first-page":"231","article-title":"Dominating cycles and paths","volume":"5","author":"Fraisse","year":"1984","journal-title":"Notices Amer. Math. Soc."},{"issue":"1\u20132","key":"10.1016\/0012-365X(90)90365-O_BIB144","first-page":"63","article-title":"Kernel systems of directed graphs","volume":"41","author":"Frank","year":"1979","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1016\/0012-365X(90)90365-O_BIB145","doi-asserted-by":"crossref","first-page":"861","DOI":"10.2307\/2314337","article-title":"Dominating set and converse dominating set of a directed graph","volume":"75","author":"Fu","year":"1968","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(90)90365-O_BIB146","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(86)90066-X","article-title":"A theorem about a conjecture of H. Meyneil on kernel-perfect graphs","volume":"59","author":"Galeana-Sanchez","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB147","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(84)90131-6","article-title":"On kernels and semikernels of digraphs","volume":"48","author":"Galeana-Sanchez","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB148","first-page":"105","article-title":"Domination of chessboards by queens on a column","volume":"19","author":"Gamble","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB149","series-title":"A Guide to the Theory of NP-completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(90)90365-O_BIB150","series-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(90)90365-O_BIB151","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(90)90345-I","article-title":"On the queen domination problem","volume":"86","author":"Grinstead","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB152","author":"Grinstead","year":"1988","journal-title":"A recurrence template for several domination-related parameters for series-parallel graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB153","first-page":"153","article-title":"Fractional domination and fractional packing in graphs","volume":"71","author":"Grinstead","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB154","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(90)90364-N","article-title":"On minimum dominating sets with minimum intersection","volume":"86","author":"Grinstead","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB155","article-title":"On the minimum intersection of minimum dominating sets in series-parallel graphs","author":"Grinstead","year":"1988","journal-title":"Proceedings Sixth International Conference on the Theory and Applications of Graphs, Kalamzoo, MI"},{"key":"10.1016\/0012-365X(90)90365-O_BIB156","series-title":"Proof Techniques in Graph Theory","first-page":"61","article-title":"Independence and covering numbers of line graphs and total graphs","author":"Gupta","year":"1969"},{"key":"10.1016\/0012-365X(90)90365-O_BIB157","article-title":"Solving NP-hard problems on graphs that are almost trees and an application to facility location problems","author":"Gurevich","year":"1982","journal-title":"IBM Research Rept. RC9348"},{"key":"10.1016\/0012-365X(90)90365-O_BIB158","author":"Hammer","year":"1984","journal-title":"Graphs whose minimal dominating sets are independent"},{"key":"10.1016\/0012-365X(90)90365-O_BIB159","series-title":"A look at graph theory","first-page":"39","article-title":"Bornes et algorithmes pour les stables d'un graphs","author":"Hansen","year":"1980"},{"key":"10.1016\/0012-365X(90)90365-O_BIB160","first-page":"121","article-title":"Characterization of trees with equal domination and independent domination numbers","volume":"55","author":"Harary","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB161","first-page":"81","article-title":"Algorithms for computing the domination number of K \u00d7 N complete grid graphs","volume":"55","author":"Hare","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB162","first-page":"115","article-title":"A linear algorithm for computing the knight's domination number of a K \u00d7 N chessboard","volume":"59","author":"Hare","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB163","series-title":"Proceedings Eighth S. E. Conference on Combinatorics, Graph Theory and Computing","first-page":"317","article-title":"Some problems on minimum dominating sets","author":"Hartnell","year":"1977"},{"key":"10.1016\/0012-365X(90)90365-O_BIB164","series-title":"Tech. Rept. CIS-TR-80-14","article-title":"Optimum domination in unicyclic graphs","author":"Hedetniemi","year":"1980"},{"key":"10.1016\/0012-365X(90)90365-O_BIB165","author":"Hedetniemi","year":"1981","journal-title":"Dominating partitions of graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB166","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"423","article-title":"Domination in trees: models and algorithms","author":"Hedetniemi","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB167","article-title":"Linear time resource allocation algorithms for trees","author":"Hedetniemi","year":"1987","journal-title":"Southeastern Conference on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0012-365X(90)90365-O_BIB168","first-page":"23","article-title":"A max-min relationship between matchings and domination in graphs","volume":"40","author":"Hedetniemi","year":"1983","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB169","first-page":"5","article-title":"A bipartite theory of graphs: I","volume":"55","author":"Hedetniemi","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB170","first-page":"137","article-title":"A bipartile theory of graphs: II","volume":"64","author":"Hedetniemi","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB171","series-title":"Graph Theory and Combinatorics","first-page":"209","article-title":"Connected domination in graphs","author":"Hedetniemi","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB172","series-title":"Applications of Discrete Mathematics","first-page":"205","article-title":"Recent results and open problems in domination theory","author":"Hedetniemi","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB173","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(86)90089-2","article-title":"A linear algorithm for finding a minimum dominating set in a cactus","volume":"13","author":"Hedetniemi","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB174","first-page":"183","article-title":"Irredundance in graphs: a survey","volume":"48","author":"Hedetniemi","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB175","author":"Hochbaum","year":"1982","journal-title":"Easy solutions for the k-center problem or the dominating set problem on random graphs"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB176","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0604023","article-title":"On the fractional solution to the set covering problem","volume":"4","author":"Hochbaum","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB177","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","article-title":"A best possible heuristic for the k-center problem","volume":"10","author":"Hochbaum","year":"1985","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB178","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(79)90030-X","article-title":"On the sum of cardinalities of extrenum maximal independent sets","volume":"26","author":"Holyer","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB179","series-title":"Tech. Rept.","article-title":"On the domination numbers of trees","author":"Hsu","year":"1980"},{"key":"10.1016\/0012-365X(90)90365-O_BIB180","series-title":"Tech. Rept.","article-title":"On the maximum coverage problem on trees","author":"Hsu","year":"1981"},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB181","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0167-6377(82)90005-0","article-title":"The distance-domination number of trees","volume":"1","author":"Hsu","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB182","author":"Hujter","year":"1984","journal-title":"The irredundance and domination numbers are equal in domistable graphs"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB183","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/jgt.3190100112","article-title":"On the domination of the products of graphs II: trees","volume":"10","author":"Jacobson","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB184","first-page":"33","article-title":"On the domination number of products of graphs: I","volume":"18","author":"Jacobson","year":"1984","journal-title":"Ars. Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB185","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","article-title":"Chordal graphs and upper irredundance, upper domination and independence","volume":"86","author":"Jacobson","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB186","first-page":"728","article-title":"Relations du type Nordhaus-Gaddum pour le nombre d'absorption d'un graphe simple","volume":"274","author":"Jaeger","year":"1972","journal-title":"C. R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(90)90365-O_BIB187","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: an ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms Part I"},{"key":"10.1016\/0012-365X(90)90365-O_BIB188","first-page":"193","article-title":"Maximum independent, minimally c-redundant sets in graphs","volume":"74","author":"Johnson","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB189","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0097-3165(71)90051-3","article-title":"On covering sets and error-correcting codes","volume":"11","author":"Kalbfleisch","year":"1971","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(90)90365-O_BIB190","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems I: the p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB191","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems II: the p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB192","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(90)90365-O_BIB193","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","article-title":"Total domination in interval graphs","volume":"22","author":"Keil","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB194","doi-asserted-by":"crossref","unstructured":"J.M. Keil and D. Schaefer, An optimal algorithm for finding dominating cycles in circular-arc graphs, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(92)90201-K"},{"key":"10.1016\/0012-365X(90)90365-O_BIB195","series-title":"Ph.D. Thesis","article-title":"Domination in graphs and its application to social network theory","author":"Kelleher","year":"1977"},{"key":"10.1016\/0012-365X(90)90365-O_BIB196","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB197","first-page":"21","article-title":"Dominating set in planar graphs","author":"Kikuno","year":"1979","journal-title":"Inst. Electronics and Comm. Eng. Japan"},{"key":"10.1016\/0012-365X(90)90365-O_BIB198","first-page":"443","article-title":"The NP-completeness of the dominating set problem in cubic planar graphs","volume":"6","author":"Kikuno","year":"1980","journal-title":"Trans. IECE Japan E63"},{"key":"10.1016\/0012-365X(90)90365-O_BIB199","article-title":"Spanning trees with many leaves, manuscript","author":"Kleitman","year":"1988","journal-title":"Fourth SIAM Conference on Discrete Mathematics, San Francisco, CA, June 13\u201316, 1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB200","first-page":"391","article-title":"Covering efficiency of trees and k-trees","volume":"18","author":"Koch","year":"1976","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB201","series-title":"Theorie der Endlichen und Unendlichen Graphen","author":"K\u00f6nig","year":"1950"},{"key":"10.1016\/0012-365X(90)90365-O_BIB202","author":"Kratochvil","year":"1987","journal-title":"On the computational complexity of codes in graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB203","article-title":"A linear time algorithm for the minimum dominating clique problem on strongly chordal graphs","author":"Kratsch","year":"1987","journal-title":"Forschungsergebnisse der FSU Jena"},{"key":"10.1016\/0012-365X(90)90365-O_BIB204","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(90)90363-M","article-title":"Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs","volume":"86","author":"Kratsch","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB205","first-page":"265","article-title":"On the total dominating set problem","volume":"54","author":"Krishnamoorthy","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB206","article-title":"Connected domination of complementary graphs","volume":"429","author":"Laskar","year":"1983"},{"key":"10.1016\/0012-365X(90)90365-O_BIB207","first-page":"291","article-title":"Vertex and edge domination parameters in graphs","volume":"48","author":"Laskar","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB208","article-title":"Domination and irredundance in graphs","volume":"434","author":"Laskar","year":"1983"},{"key":"10.1016\/0012-365X(90)90365-O_BIB209","article-title":"Domination and irredundance in split graphs","volume":"430","author":"Laskar","year":"1983"},{"key":"10.1016\/0012-365X(90)90365-O_BIB210","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","article-title":"On the algorithmic complexity of total domination","volume":"5","author":"Laskar","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(90)90365-O_BIB211","series-title":"Combinatorics and graph theory","first-page":"308","article-title":"On domination related concepts in graph theory (Calcutta, 1980)","volume":"885","author":"Laskar","year":"1981"},{"key":"10.1016\/0012-365X(90)90365-O_BIB212","series-title":"Graph Theory with Applications to Algorithms and Computer Science","first-page":"501","article-title":"A linear time algorithm for finding an optimal dominating subforest of a tree","author":"Lawler","year":"1985"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB213","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4153\/CMB-1977-034-8","article-title":"On spanning and dominating circuits in graphs","volume":"20","author":"Lesniak-Foster","year":"1977","journal-title":"Canad. Bull. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB214","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"issue":"3\u20134","key":"10.1016\/0012-365X(90)90365-O_BIB215","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/00207168408803411","article-title":"Two algorithms for determining a minimum independent dominating set","volume":"15","author":"Loukakis","year":"1984","journal-title":"Internat. J. Comput. Math."},{"issue":"3\u20134","key":"10.1016\/0012-365X(90)90365-O_BIB216","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/00207168408803411","article-title":"Two algorithms for determining a minimum independent dominating set","volume":"15","author":"Loukakis","year":"1984","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB217","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(86)90095-6","article-title":"On kernels in i-triangulated graphs","volume":"61","author":"Maffray","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB218","first-page":"3522","article-title":"Sur la determination des nombres de stabilite et du nombre chromatique d'un graphe","volume":"248","author":"Maghout","year":"1959","journal-title":"C. R. Acad. Sci. Paris"},{"issue":"2\u20133","key":"10.1016\/0012-365X(90)90365-O_BIB219","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0012-365X(84)90052-9","article-title":"Structure and recognition of domishold graphs","volume":"50","author":"Marchioro","year":"1984","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB220","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/36.2.221","article-title":"A new upper bound for the domination number of a graph","volume":"36","author":"Marcu","year":"1985","journal-title":"Quart. J. Math. Oxford Ser."},{"issue":"1\u20132","key":"10.1016\/0012-365X(90)90365-O_BIB221","first-page":"57","article-title":"Generalized kernels with considerations to the tournament digraphs","volume":"24","author":"Marcu","year":"1982","journal-title":"Mathematica (cluj)"},{"issue":"29","key":"10.1016\/0012-365X(90)90365-O_BIB222","first-page":"35","article-title":"On the existence of a kernel in a strong connected diagraph (Romanian Summary)","volume":"25","author":"Marcu","year":"1979","journal-title":"Bul. Inst. Politehn. lasi Sect. I"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB223","first-page":"417","article-title":"Some remarks concerning the kernels of a strong connected diagraph","volume":"26","author":"Marcu","year":"1980","journal-title":"An. Stiint. Univ. \u201cAl. l. Cuza\u201d lasi Sect. I a Math. (N.S.)"},{"key":"10.1016\/0012-365X(90)90365-O_BIB224","series-title":"Combinatorial Mathematics IV","first-page":"142","article-title":"The number and stability indices of Cn-trees","volume":"560","author":"McAvaney","year":"1976"},{"key":"10.1016\/0012-365X(90)90365-O_BIB225","first-page":"639","article-title":"Strong independence in graphs","volume":"29","author":"McFall","year":"1980","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB226","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(90)90361-K","article-title":"Best location of service centers in a tree-like network under budget constraints","volume":"86","author":"McHugh","year":"1990","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB227","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0604028","article-title":"The maximum coverage location problem","volume":"4","author":"Megiddo","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB228","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.3190010211","article-title":"Packing and covering constants for certain families of trees","volume":"1","author":"Meir","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB229","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1977-0460161-7","article-title":"Packing and covering constants for certain families of trees: II","volume":"233","author":"Meir","year":"1977","journal-title":"Trans. Amer. Soc."},{"key":"10.1016\/0012-365X(90)90365-O_BIB230","series-title":"Theory and Applications of Graphs","first-page":"403","article-title":"Packing and covering constants for recursive trees","volume":"642","author":"Meir","year":"1978"},{"key":"10.1016\/0012-365X(90)90365-O_BIB231","doi-asserted-by":"crossref","first-page":"225","DOI":"10.2140\/pjm.1975.61.225","article-title":"Relations between packing and covering numbers of a tree","volume":"61","author":"Meir","year":"1975","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB232","series-title":"Ph.D. Thesis","article-title":"Linear algorithms on trees and maximal outerplanar graphs: design, complexity analysis and data structures study","author":"Mitchell","year":"1977"},{"key":"10.1016\/0012-365X(90)90365-O_BIB233","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(79)90053-9","article-title":"Linear algorithms on recursive representations of trees","volume":"18","author":"Mitchell","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB234","series-title":"Proceedings Eighth S.E. Conference on Combinatorics, Graph Theory and Computing","first-page":"489","article-title":"Edge domination in trees","author":"Mitchell","year":"1977"},{"key":"10.1016\/0012-365X(90)90365-O_BIB235","series-title":"Proceedings Sixth S. E. Conference Combinatorics, Graph Theory and Computing","first-page":"467","article-title":"Some linear algorithms on trees","author":"Mitchell","year":"1975"},{"key":"10.1016\/0012-365X(90)90365-O_BIB236","article-title":"The NP-completeness of Hamiltonian circuit for chordal bipartite graphs","author":"M\u00fcller","year":"1987","journal-title":"Forschungsergebnisse der FSU Jena"},{"key":"10.1016\/0012-365X(90)90365-O_BIB237","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","article-title":"The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs","volume":"53","author":"M\u00fcller","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB238","series-title":"Res. Rept. 57\/88(2)","article-title":"On a Ramsey type problem for independent domination parameter of graphs","author":"Mynhardt","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB239","author":"Mynhardt","year":"1988","journal-title":"On the difference between the domination and independent domination numbers of cubic graphs, preprint"},{"key":"10.1016\/0012-365X(90)90365-O_BIB240","first-page":"195","article-title":"k-minimal domination numbers of cycles","volume":"23-A","author":"Mynhardt","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB241","series-title":"Studies in Pure Mathematics","first-page":"157","article-title":"Edge-disjoint hamiltonian circuits in graphs with vertices of large degree","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0012-365X(90)90365-O_BIB242","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(78)90012-1","article-title":"Optimum domination in weighted trees","volume":"7","author":"Natarajan","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB243","author":"Neeralagi","year":"1987","journal-title":"Complete domination and neighbourhood numbers of a graph, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB244","author":"Neeralagi","year":"1988","journal-title":"Strong, weak edge domination in a graph, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB245","author":"Newman","year":"1988","journal-title":"Connecting sets in graphs\u2014a domination related concept, manuscript"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB246","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TCS.1974.1083808","article-title":"A method to determine a minimal dominating set of a graph Go","volume":"CAS-21","author":"Nieminen","year":"1974","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0012-365X(90)90365-O_BIB247","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","article-title":"Two bounds for the domination number of a graph","volume":"14","author":"Nieminen","year":"1974","journal-title":"J. Inst. Math. Applics."},{"key":"10.1016\/0012-365X(90)90365-O_BIB248","first-page":"206","article-title":"Theory of Graphs","volume":"38","author":"Ore","year":"1962"},{"key":"10.1016\/0012-365X(90)90365-O_BIB249","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(90)90286-Q","article-title":"A class of threshold and domishold graphs: equistable and equidominating graphs","volume":"29","author":"Payan","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB250","unstructured":"C. Payan, Remarks on cliques and dominating sets in graphs, manuscript, undated."},{"issue":"2.3.4","key":"10.1016\/0012-365X(90)90365-O_BIB251","article-title":"Sur le nombre d'absorption d'un graphe simple","volume":"171","author":"Payan","year":"1975","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB252","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190060104","article-title":"Domination-balanced graphs","volume":"6","author":"Payan","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB253","series-title":"Ph.D. Thesis","article-title":"Algorithmic complexities of domination-related graph parameters","author":"Pfaff","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB254","first-page":"71","article-title":"Linear algorithms for independent domination and total domination in series-parallel graphs","volume":"45","author":"Pfaff","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB255","article-title":"NP-completeness of total and connected domination, and irredundance for bipartite graphs","volume":"428","author":"Pfaff","year":"1983"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB256","first-page":"187","article-title":"Quasi-kernels of minimum weakness in a graph","volume":"20","author":"Phillippe","year":"1977","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/0012-365X(90)90365-O_BIB257","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF00995176","article-title":"Minimum dominating cycles of two-trees","volume":"8","author":"Proskurowski","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB258","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00977745","article-title":"Minimum dominating cycles in outerplanar graphs","volume":"10","author":"Proskurowski","year":"1981","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB259","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(90)90351-H","article-title":"Domatically critical and domatically full graphs","volume":"86","author":"Rall","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB260","first-page":"97","article-title":"On location-domination numbers for certain classes of graphs","volume":"45","author":"Rall","year":"1984","journal-title":"Congr. Numer."},{"issue":"5","key":"10.1016\/0012-365X(90)90365-O_BIB261","first-page":"613","article-title":"(1-k)-domination in a graph","volume":"22","author":"Sampathkumar","year":"1988","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB262","series-title":"K-size vertex covering and domination numbers of a graph","author":"Sampathkumar","year":"1988"},{"issue":"5","key":"10.1016\/0012-365X(90)90365-O_BIB263","first-page":"613","article-title":"Strong, weak domination and domination balance in a graph","volume":"22","author":"Sampathkumar","year":"1990","journal-title":"D. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB264","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(90)90356-M","article-title":"The least point covering and domination numbers of a graph","volume":"86","author":"Sampathkumar","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB265","series-title":"Mixed domination in graphs","author":"Sampathkumar","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB266","series-title":"Independent, perfect and connected neighborhood numbers of a graph","author":"Sampathkumar","year":"1988"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB267","first-page":"126","article-title":"The neighborhood number of a graph","volume":"16","author":"Sampathkumar","year":"1985","journal-title":"Indian J. Pure Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB268","series-title":"Domination, independent and cover partitions of a graph","author":"Sampathkumar","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB269","unstructured":"E. Sampathkumar and H.B. Walikar, On a conjecture of Cockayne and Hedetniemi, J. Comput. Inform. System Sci., to appear."},{"issue":"6","key":"10.1016\/0012-365X(90)90365-O_BIB270","first-page":"607","article-title":"The connected domination number of a graph","volume":"13","author":"Sampathkumar","year":"1979","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB271","series-title":"Maximum number of edges in connected graphs with a given domination number","author":"Sanchis","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB272","series-title":"Report R-MATH-03\/87","article-title":"Linear-time algorithms for NP-complete problems restricted to partial k-trees","author":"Scheffler","year":"1987"},{"key":"10.1016\/0012-365X(90)90365-O_BIB273","doi-asserted-by":"crossref","first-page":"231","DOI":"10.2307\/2309682","article-title":"Some packing problems","volume":"67","author":"Scheid","year":"1960","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(90)90365-O_BIB274","series-title":"Proceedings Eighth Conference on Graph Theoretic Concepts in Computer Science (WG 82)","first-page":"251","article-title":"Kernel in bipartite graphs (German summary)","author":"Schmidt","year":"1982"},{"key":"10.1016\/0012-365X(90)90365-O_BIB275","doi-asserted-by":"crossref","unstructured":"G. Schimidt and T. Strohlein, On kernels of graphs and solutions of games: a sypnosis based on relations and fixpoints, SIAM J. Algebraic Discrete Methods 6 (1) 54\u201365.","DOI":"10.1137\/0606006"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB276","first-page":"269","article-title":"Algorithmen zur Bestimmung intern und extern stabiler Mengen und der chromatischen Zahl eines endlichen Graphen","volume":"17","author":"Schone","year":"1975","journal-title":"Wiss. Z. Techn. Hochsch. Karl Marx-Stadt"},{"key":"10.1016\/0012-365X(90)90365-O_BIB277","doi-asserted-by":"crossref","unstructured":"D. Seese, Tree-partite graphs and the complexity of algorithms, in: FCT 85, Lecture Notes in Computer Science 199 (Springer, Berlin) 412\u2013421.","DOI":"10.1007\/BFb0028825"},{"key":"10.1016\/0012-365X(90)90365-O_BIB278","article-title":"Minimum dominating, optimally independent vertex sets in graphs","author":"Selig","year":"1988","journal-title":"Proceedings Sixth International Conference on the Theory and Applications of Graphs"},{"key":"10.1016\/0012-365X(90)90365-O_BIB279","first-page":"8","article-title":"On stabilities and chromatic number of a loop graph","author":"Shee","year":"1970","journal-title":"Nanta Math. IV"},{"key":"10.1016\/0012-365X(90)90365-O_BIB280","series-title":"Tech. Rept. DM-327-IR","article-title":"Domination parameters for the Bishops Graph","author":"Shepherd","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB281","first-page":"109","article-title":"Algebra of sets applied to solution of graph theory problems","volume":"no. 3","author":"Shneyder","year":"1970","journal-title":"Izv. Akad. Nauk SSSR Tehn. Kibernet."},{"key":"10.1016\/0012-365X(90)90365-O_BIB282","first-page":"72","article-title":"Minimal coverings of a finite set I (Russian)","volume":"21","author":"Sirokov","year":"1972","journal-title":"Diskret Analiz."},{"key":"10.1016\/0012-365X(90)90365-O_BIB283","first-page":"57","article-title":"Minimal coverings of a finite set II (Russian): connected coverings","volume":"22","author":"Sirokov","year":"1973","journal-title":"Diskret Analiz."},{"key":"10.1016\/0012-365X(90)90365-O_BIB284","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(90)90362-L","article-title":"Dominating cycles in Halin graphs","volume":"86","author":"Skowro\u0144ska","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB285","doi-asserted-by":"crossref","first-page":"335","DOI":"10.4153\/CMB-1978-058-5","article-title":"A characterization of SOFT hypergraphs","volume":"21","author":"Slater","year":"1978","journal-title":"Canad. Math. Bull."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB286","first-page":"323","article-title":"Dominating and reference sets in a graph","volume":"22","author":"Slater","year":"1989","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB287","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230170105","article-title":"Domination and location in acyclic graphs","volume":"17","author":"Slater","year":"1987","journal-title":"Networks"},{"key":"10.1016\/0012-365X(90)90365-O_BIB288","doi-asserted-by":"crossref","first-page":"197","DOI":"10.6028\/jres.082.019","article-title":"Enclaveless sets and MK-systems","volume":"82","author":"Slater","year":"1977","journal-title":"J. Res. Nat Bur. Standards"},{"key":"10.1016\/0012-365X(90)90365-O_BIB289","series-title":"Proceedings Fifth S. E. Conference on Combinatorics, Graph Theory and Computing","first-page":"647","article-title":"Irreducible point independence numbers and independence graphs","author":"Slater","year":"1974"},{"key":"10.1016\/0012-365X(90)90365-O_BIB290","series-title":"Proceedings Sixth S.E. Conference on Combinatorics, Graph Theory and Computing","first-page":"549","article-title":"Leaves of trees","author":"Slater","year":"1975"},{"key":"10.1016\/0012-365X(90)90365-O_BIB291","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","article-title":"R-domination in graphs","volume":"23","author":"Slater","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0012-365X(90)90365-O_BIB292","series-title":"Tech. Rept. DM-376-IR","article-title":"An upper bound for the domination number of the queens graph","author":"Spencer","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB293","series-title":"Ph.D. Thesis, Tech. Rept. 185\/85","article-title":"Permutation in graph structure and algorithms","author":"Stewart","year":"1985"},{"key":"10.1016\/0012-365X(90)90365-O_BIB294","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(90)90347-K","article-title":"Critical concepts in domination","volume":"86","author":"Sumner","year":"1990","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB295","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0095-8956(83)90007-2","article-title":"Domination critical graphs","volume":"34","author":"Sumner","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(90)90365-O_BIB296","author":"Sun","year":"1988","journal-title":"Contributions to connected domination in graphs, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB297","series-title":"Proceedings of the WG`83","first-page":"342","article-title":"NP-complete problems on some tree-structured graphs: a review","author":"Syslo","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB298","first-page":"347","article-title":"The calculation of a-sets of representatives","volume":"13","author":"Syslo","year":"1972","journal-title":"Zastos. Mat."},{"key":"10.1016\/0012-365X(90)90365-O_BIB299","first-page":"56","article-title":"Some properties of the structure of the set of kernels of a symmetric graph (Russian)","author":"Tjagunov","year":"1979","journal-title":"Trudy Inst. Mat. i Meh, Ural. Naucn. Centr Akad. Nauk SSSR 27"},{"key":"10.1016\/0012-365X(90)90365-O_BIB300","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(90)90354-K","article-title":"Covering all cliques of a graph","volume":"86","author":"Tuza","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB301","series-title":"Graphs and other combinatorial topics (Prague, 1982)","first-page":"209","article-title":"Rank and domination number","volume":"59","author":"Van Nuffelen","year":"1983"},{"key":"10.1016\/0012-365X(90)90365-O_BIB302","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(83)90165-6","article-title":"Existence of dominating cycles and paths","volume":"43","author":"Veldman","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB303","first-page":"487","article-title":"A lower bound for the number of edges of a graph with prescribed internal and external stability numbers","author":"Vinnicenko","year":"1973","journal-title":"Dopovidi Akad. Nauk Ukrain RSR Ser. A"},{"key":"10.1016\/0012-365X(90)90365-O_BIB304","first-page":"729","article-title":"A bound on the external stability number of a graph","volume":"164","author":"Vizing","year":"1965","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0012-365X(90)90365-O_BIB305","author":"Walikar","year":"1979","journal-title":"On star-partition number of a graph, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB306","series-title":"Ph.D. Thesis","article-title":"Some topics in graph theory (contributions to the theory of domination in graphs and its applications)","author":"Walikar","year":"1980"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB307","first-page":"70","article-title":"Domination critical graphs","volume":"2","author":"Walikar","year":"1979","journal-title":"Nat. Acad. Sci. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB308","unstructured":"H.B. Walikar and B.D. Acharya, On an extremal problem concerning a Nordhaus-Gaddum type result in the theory of domination in graphs, manuscript, undated."},{"key":"10.1016\/0012-365X(90)90365-O_BIB309","article-title":"Recent developments in the theory of domination in graphs","volume":"1","author":"Walikar","year":"1979"},{"key":"10.1016\/0012-365X(90)90365-O_BIB310","author":"Walikar","year":"1979","journal-title":"Two new bounds for the domination number of a graph, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB311","author":"Wang","year":"1984","journal-title":"On the sum of two parameters concerning independence and irredundance in a graph, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB312","first-page":"31","article-title":"Domination number for almost every graph","volume":"16","author":"Weber","year":"1981","journal-title":"Rostock. Math. Kolloq."},{"key":"10.1016\/0012-365X(90)90365-O_BIB313","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"15","author":"White","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0012-365X(90)90365-O_BIB314","series-title":"An O(n) algorithm for domination in k-chordal graphs","author":"Wimer","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB315","series-title":"Proceedings 17th S.E. Conference on Combinatorics, Graph Theory and Computing","article-title":"Linear algorithms for the dominating cycle problems in series-parallel graphs, 2-trees and Halin graphs","author":"Wimer","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB316","series-title":"Ph.D. Thesis","article-title":"Linear algorithms on k-terminal graphs","author":"Wimer","year":"1987"},{"key":"10.1016\/0012-365X(90)90365-O_BIB317","first-page":"43","article-title":"A methodology for constructing linear graph algorithms","volume":"50","author":"Wimer","year":"1985","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB318","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/0138030","article-title":"Edge dominating sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB319","first-page":"99","article-title":"Adomatic and idomatic numbers of graphs","volume":"33","author":"Zelinka","year":"1983","journal-title":"Math. Slovaca"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB320","doi-asserted-by":"crossref","first-page":"113","DOI":"10.21136\/CPM.1985.108591","article-title":"Bichromaticity and domatic number of a bipartite graph","volume":"110","author":"Zelinka","year":"1985","journal-title":"Casopis Pest. Mat."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB321","first-page":"27","article-title":"Complementarily domatic number of a graph","volume":"38","author":"Zelinka","year":"1988","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(90)90365-O_BIB322","series-title":"Graph Theory, Lagow 1981","first-page":"278","article-title":"Domatic number and bichromaticity of a graph","volume":"1018","author":"Zelinka","year":"1983"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB323","first-page":"145","article-title":"Domatic number and degrees of vertices of a graph","volume":"33","author":"Zelinka","year":"1983","journal-title":"Math. Slovaca"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB324","first-page":"117","article-title":"Domatic numbers of cube graphs (Russian summary)","volume":"32","author":"Zelinka","year":"1982","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(90)90365-O_BIB325","unstructured":"B. Zelinka, Domatic numbers of directed graphs, Czech, Math. J., to appear."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB326","first-page":"129","article-title":"Domatic numbers of uniform hypergraphs","volume":"21","author":"Zelinka","year":"1985","journal-title":"Arch. Math."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB327","doi-asserted-by":"crossref","first-page":"82","DOI":"10.21136\/CPM.1983.118161","article-title":"Domatically cocritical graphs","volume":"108","author":"Zelinka","year":"1983","journal-title":"Casopis Pest. Mat."},{"issue":"105","key":"10.1016\/0012-365X(90)90365-O_BIB328","doi-asserted-by":"crossref","first-page":"486","DOI":"10.21136\/CMJ.1980.101697","article-title":"Domatically critical graphs","volume":"30","author":"Zelinka","year":"1980","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(90)90365-O_BIB329","series-title":"Discrete mathematics and its applications to mathematical cybernetics","first-page":"69","article-title":"Domatische Zahlen der Graphen (Domatic numbers of graphs)","author":"Zelinka","year":"1981"},{"issue":"108","key":"10.1016\/0012-365X(90)90365-O_BIB330","doi-asserted-by":"crossref","first-page":"107","DOI":"10.21136\/CMJ.1983.101860","article-title":"Edge-domatic number of a graph","volume":"33","author":"Zelinka","year":"1983","journal-title":"Czech. Math. J."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB331","first-page":"91","article-title":"On domatic numbers of graphs (Russian summary)","volume":"31","author":"Zelinka","year":"1981","journal-title":"Math. Slovaca"},{"issue":"108","key":"10.1016\/0012-365X(90)90365-O_BIB332","doi-asserted-by":"crossref","first-page":"309","DOI":"10.21136\/CMJ.1983.101879","article-title":"On k-domatic numbers of graphs","volume":"33","author":"Zelinka","year":"1983","journal-title":"Czech. Math. J."},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB333","first-page":"313","article-title":"On k-ply domatic numbers of graphs","volume":"34","author":"Zelinka","year":"1984","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(90)90365-O_BIB334","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90350-Q","article-title":"Regular totally domatically full graphs","volume":"86","author":"Zelinka","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB335","first-page":"371","article-title":"Semidomatic numbers of directed graphs","volume":"34","author":"Zelinka","year":"1984","journal-title":"Math. Slovaca"},{"key":"10.1016\/0012-365X(90)90365-O_BIB336","doi-asserted-by":"crossref","first-page":"373","DOI":"10.21136\/CPM.1981.108482","article-title":"Some remarks on domatic numbers of graphs","volume":"106","author":"Zelinka","year":"1981","journal-title":"Casopis Pest. Mat."},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB337","doi-asserted-by":"crossref","first-page":"56","DOI":"10.21136\/CPM.1988.118332","article-title":"The bigraph decomposition number of a graph","volume":"113","author":"Zelinka","year":"1986","journal-title":"Casopis Pest. Mat."},{"key":"10.1016\/0012-365X(90)90365-O_BIB338","unstructured":"B. Zelinka, Uniquely domatic regular domatically full graphs, Czech. Math. J., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB339","series-title":"Proceedings 15th International Colloquium on Automata, Languages and Programming","first-page":"38","article-title":"Problems easy for tree-decomposable graphs, extended abstract","volume":"317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB340","unstructured":"M.J. Atallah, G.K. Manacher and J. Urrutia, Finding a minimum independent dominating set in a permutation graph, Tech. Rept., Dept. Computer Science, Purdue Univ."},{"key":"10.1016\/0012-365X(90)90365-O_BIB341","series-title":"Applications of Discrete Mathematics, SIAM","first-page":"200","article-title":"Recent problems and results about kernels in directed graphs","author":"Berge","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB342","series-title":"Proceedings 15th International Colloquium on Automata, Languages and Programming","first-page":"105","article-title":"Dynamic programming on graphs with bounded treewidth","volume":"317","author":"Bodlaender","year":"1988"},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB343","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/jgt.3190130303","article-title":"Irredundant Ramsey numbers for graphs","volume":"13","author":"Brewster","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB344","unstructured":"E.J. Cockayne, G. Fricke, S.T. Hedetniemi and C.M. Mynhardt, Properties of minimal dominating functions of graphs, Discrete Math., submitted."},{"key":"10.1016\/0012-365X(90)90365-O_BIB345","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0012-365X(88)90192-6","article-title":"Gallai theorems for graphs, hypergraphs and set systems","volume":"72","author":"Cockayne","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB346","author":"Cockayne","year":"1987","journal-title":"Domination sequences of graphs, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB347","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","article-title":"Distance-hereditary graphs, Steiner trees, and connected domination","volume":"17","author":"D'Atri","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90365-O_BIB348","series-title":"External Tech. Rept. ISSN-0836-0227-90-266","article-title":"Neighborhood covers for trees","author":"Dawes","year":"1990"},{"issue":"2","key":"10.1016\/0012-365X(90)90365-O_BIB349","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(88)90058-3","article-title":"An extremal problem for the edge domination insensitive graphs","volume":"20","author":"Dutton","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB350","author":"Elmallah","year":"1990","journal-title":"Domination in polygon graphs, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB351","author":"Elmallah","year":"1990","journal-title":"Independence and domination in polygon graphs, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB352","series-title":"The domination number for the product of graphs","author":"Faudree","year":"1990"},{"key":"10.1016\/0012-365X(90)90365-O_BIB353","first-page":"159","article-title":"k-domination and k-independence in graphs","author":"Favaron","year":"1988","journal-title":"Ars Combin. 25-C"},{"key":"10.1016\/0012-365X(90)90365-O_BIB354","series-title":"The irredundance cube","author":"Fellows","year":"1990"},{"key":"10.1016\/0012-365X(90)90365-O_BIB356","first-page":"191","article-title":"On locating dominating sets and well-covered graphs","volume":"65","author":"Finbow","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB357","first-page":"5","article-title":"Well-dominated graphs: a collection of well-covered ones","volume":"25-A","author":"Finbow","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB358","doi-asserted-by":"crossref","unstructured":"P. Flach and L. Volkmann, Estimations for the domination number of a graph, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(90)90114-W"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB359","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(88)90033-7","article-title":"A note on distance dominating cycles","volume":"71","author":"Fraisse","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB370","series-title":"On the equivalence of the upper irredundance and fractional upper irredundance numbers of a graph","author":"Fricke","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB371","first-page":"199","article-title":"Upper domination on double cone graphs","volume":"72","author":"Fricke","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB372","series-title":"When is an irredundant function on a graph maximal?","author":"Fricke","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB373","unstructured":"G. Fricke, E.O. Hare, D.P. Jacobs and A. Majumdar, On integral and fractional total domination, Congr. Numer., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB374","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(89)90308-7","article-title":"Inequalities between the domination number and the chromatic number of a graph","volume":"76","author":"Genert","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB375","series-title":"Ph.D. Thesis","article-title":"Algorithmic templates and multiset problems in graphs","author":"Grinstead","year":"1989"},{"key":"10.1016\/0012-365X(90)90365-O_BIB376","series-title":"The caterpillars with equal domination and independent domination numbers","author":"Harary","year":"1988"},{"key":"10.1016\/0012-365X(90)90365-O_BIB377","series-title":"Ph.D. Thesis","article-title":"Algorithms for grids and grid-like graphs","author":"Hare","year":"1989"},{"key":"10.1016\/0012-365X(90)90365-O_BIB378","unstructured":"E.O. Hare, K-weight domination and fractional domination of Pm x Pn, Congr. Numer., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB379","series-title":"Discrete Algorithms and Complexity, Proceedings Japan-US Joint Seminar","first-page":"437","article-title":"Linear-time computability of combinatorial problems on generalized-series-parallel graphs","author":"Hare","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB380","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi and D.P. Jacobs, Private domination: theory and algorithms, congr. Numer., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB381","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1111\/j.1749-6632.1989.tb16403.x","article-title":"On irredundance, dimension and rank in posets","volume":"576","author":"Hedetniemi","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB382","author":"Henning","year":"1989","journal-title":"Bounds on a generalized domination parameter, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB383","unstructured":"M.A. Henning and H.C. Swart, Bounds on a generalized total domination parameter, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB384","series-title":"Bounds relating generalized domination parameters","author":"Henning","year":"1989"},{"key":"10.1016\/0012-365X(90)90365-O_BIB385","series-title":"Minimum edge dominating sets","author":"Horton","year":"1989"},{"key":"10.1016\/0012-365X(90)90365-O_BIB386","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230190111","article-title":"Domination theory and the Crapo \u03b2-invariant","volume":"1","author":"Huseby","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0012-365X(90)90365-O_BIB387","series-title":"Bibliography on the minimum dominating set problem","author":"Hujter","year":"1984"},{"key":"10.1016\/0012-365X(90)90365-O_BIB388","author":"Irving","year":"1990","journal-title":"On approximating the minimum independent dominating set, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB389","unstructured":"A.H. C, Solutions to the N\u00d7N knights cover problem, J. Recreational Math., to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB390","first-page":"7","article-title":"Complexity question for n-domination and related parameters","volume":"68","author":"Jacobson","year":"1989","journal-title":"Congr. Numer."},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB391","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01788558","article-title":"Line domination in graphs","volume":"3","author":"Jayaram","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(90)90365-O_BIB392","author":"Kok","year":"1990","journal-title":"Reinforcement in graphs,manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB393","author":"Kratsch","year":"1989","journal-title":"Domination on cocomparability graphs, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB394","first-page":"237","article-title":"Remarks on domatic number","volume":"46\/47","author":"Kys","year":"1986","journal-title":"Acta Math. Univ. Comenian"},{"key":"10.1016\/0012-365X(90)90365-O_BIB395","author":"Laskar","year":"1990","journal-title":"A fractional view of graph theory, manuscript"},{"key":"10.1016\/0012-365X(90)90365-O_BIB396","author":"Manacher","year":"1984","journal-title":"Efficient algorithms for new problems on interval graphs and interval models, manuscript"},{"issue":"1","key":"10.1016\/0012-365X(90)90365-O_BIB397","doi-asserted-by":"crossref","first-page":"41","DOI":"10.7146\/math.scand.a-12152","article-title":"An upper bound on the domination number of a graph","volume":"59","author":"Marcu","year":"1986","journal-title":"Math. Scand."},{"issue":"6","key":"10.1016\/0012-365X(90)90365-O_BIB398","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","article-title":"Domination in graphs with minimum degree two","volume":"13","author":"McCuaig","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90365-O_BIB399","series-title":"Ph.D. Thesis","article-title":"Theoretical and algorithmic results on domination and connectivity","author":"Peters","year":"1986"},{"key":"10.1016\/0012-365X(90)90365-O_BIB400","author":"Rall","year":"1990","journal-title":"Dominating a graph and its complement"},{"key":"10.1016\/0012-365X(90)90365-O_BIB401","first-page":"100","article-title":"A fractional version of domatic number","volume":"74","author":"Rall","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB402","doi-asserted-by":"crossref","unstructured":"G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems in interval graphs, Inform. Process. Lett., to appear.","DOI":"10.1016\/0020-0190(88)90091-9"},{"key":"10.1016\/0012-365X(90)90365-O_BIB403","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(88)90076-2","article-title":"Total domination in interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(90)90365-O_BIB404","first-page":"377","article-title":"The global domination number of a graph","volume":"23","author":"Sampathkumar","year":"1989","journal-title":"J. Math. Phys. Sci."},{"key":"10.1016\/0012-365X(90)90365-O_BIB405","first-page":"5","article-title":"A parallel implementation for the domination number of a grid graph","volume":"59","author":"Singh","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(90)90365-O_BIB406","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(90)90365-O_BIB407","unstructured":"J. Topp and L. Volkmann, Characterization of unicyclic graphs with equal domination and independence numbers, submitted."},{"key":"10.1016\/0012-365X(90)90365-O_BIB408","unstructured":"J. Topp and L. Volkmann, On domination and independence numbers of graphs, results in mathematics, to appear."},{"key":"10.1016\/0012-365X(90)90365-O_BIB409","series-title":"On graphs with equal domination and independent domination numbers","author":"Topp","year":"1990"},{"key":"10.1016\/0012-365X(90)90365-O_BIB410","series-title":"On packing and covering numbers of graphs","author":"Topp","year":"1990"},{"key":"10.1016\/0012-365X(90)90365-O_BIB411","series-title":"Some upper bounds for the product of the domination number and the chromatic,number of a graph","author":"Topp","year":"1990"},{"key":"10.1016\/0012-365X(90)90365-O_BIB412","series-title":"Well covered and well dominated block graphs and unicyclic graphs","author":"Topp","year":"1990"},{"issue":"4","key":"10.1016\/0012-365X(90)90365-O_BIB413","first-page":"389","article-title":"Connected domatic number of a graph","volume":"36","author":"Zelinka","year":"1986","journal-title":"Math. Slovaca"},{"issue":"3","key":"10.1016\/0012-365X(90)90365-O_BIB414","first-page":"207","article-title":"Total domatic number of cacti","volume":"38","author":"Zelinka","year":"1988","journal-title":"Math. Slovaca"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090365O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090365O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T16:07:09Z","timestamp":1681834029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090365O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":403,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090365O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90365-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}