Xie, Rong; Oi, De-Yu; Li, Yong-jun; Qian, Zheng-ping Efficient algorithm for finding minimum connected dominating set in wireless sensor networks. (Chinese. English summary) Zbl 1172.68679 J. Comput. Appl. 28, No. 2, 342-344 (2008). MSC: 68W15 PDFBibTeX XMLCite \textit{R. Xie} et al., J. Comput. Appl. 28, No. 2, 342--344 (2008; Zbl 1172.68679) Full Text: DOI
Bonsma, Paul S. Spanning trees with many leaves in graphs with minimum degree three. (English) Zbl 1181.05051 SIAM J. Discrete Math. 22, No. 3, 920-937 (2008). MSC: 05C35 05C69 05C85 PDFBibTeX XMLCite \textit{P. S. Bonsma}, SIAM J. Discrete Math. 22, No. 3, 920--937 (2008; Zbl 1181.05051) Full Text: DOI
Wang, Xin-Yu; Yang, Xiao-Hu; Sun, Jian-Ling; Li, Wei; Shi, Wei; Li, Shan-Ping An effective connected dominating set based mobility management algorithm in manets. (English) Zbl 1152.68373 J. Zhejiang Univ., Sci. A 9, No. 10, 1318-1325 (2008). MSC: 68M10 PDFBibTeX XMLCite \textit{X.-Y. Wang} et al., J. Zhejiang Univ., Sci. A 9, No. 10, 1318--1325 (2008; Zbl 1152.68373) Full Text: DOI
Bonsma, Paul; Zickfeld, Florian A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs. (English) Zbl 1202.68274 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 66-77 (2008). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{P. Bonsma} and \textit{F. Zickfeld}, Lect. Notes Comput. Sci. 5344, 66--77 (2008; Zbl 1202.68274) Full Text: DOI Link
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter Solving connected dominating set faster than \(2^n\). (English) Zbl 1170.68030 Algorithmica 52, No. 2, 153-166 (2008). MSC: 68R10 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Algorithmica 52, No. 2, 153--166 (2008; Zbl 1170.68030) Full Text: DOI
Li, Yongjie On criticality of critically \(h\)-edge-connected graphs. (English) Zbl 1164.05396 Math. Appl. 21, No. 1, 59-66 (2008). MSC: 05C40 05C69 05C35 PDFBibTeX XMLCite \textit{Y. Li}, Math. Appl. 21, No. 1, 59--66 (2008; Zbl 1164.05396)
Czyzowicz, J.; Dobrev, S.; Fevens, T.; González-Aguilar, H.; Kranakis, E.; Opatrny, J.; Urrutia, J. Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. (English) Zbl 1136.68453 Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 158-169 (2008). MSC: 68R10 05C85 68M12 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Lect. Notes Comput. Sci. 4957, 158--169 (2008; Zbl 1136.68453) Full Text: DOI
Shang, Weiping; Yao, Frances; Wan, Pengjun; Hu, Xiaodong Algorithms for minimum \(m\)-connected \(k\)-dominating set problem. (English) Zbl 1175.05104 Dress, Andreas (ed.) et al., Combinatorial optimization and applications. First international conference, COCOA 2007, Xi’an, China, August 14–16, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73555-7/pbk). Lecture Notes in Computer Science 4616, 182-190 (2007). MSC: 05C69 05C85 68W25 90B18 PDFBibTeX XMLCite \textit{W. Shang} et al., Lect. Notes Comput. Sci. 4616, 182--190 (2007; Zbl 1175.05104) Full Text: DOI
Ananchuen, Nawarat On domination critical graphs with cutvertices having connected domination number 3. (English) Zbl 1145.05038 Int. Math. Forum 2, No. 61-64, 3041-3052 (2007). Reviewer: Martin Knor (Bratislava) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{N. Ananchuen}, Int. Math. Forum 2, No. 61--64, 3041--3052 (2007; Zbl 1145.05038) Full Text: DOI
Thai, My T.; Zhang, Ning; Tiwari, Ravi; Xu, Xiaochun On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs. (English) Zbl 1124.68082 Theor. Comput. Sci. 385, No. 1-3, 49-59 (2007). MSC: 68R10 68M15 68W25 PDFBibTeX XMLCite \textit{M. T. Thai} et al., Theor. Comput. Sci. 385, No. 1--3, 49--59 (2007; Zbl 1124.68082) Full Text: DOI
Shang, Weiping; Wan, Pengjun; Yao, Frances; Hu, Xiaodong Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem. (English) Zbl 1188.68359 Theor. Comput. Sci. 381, No. 1-3, 241-247 (2007). MSC: 68W25 68M10 PDFBibTeX XMLCite \textit{W. Shang} et al., Theor. Comput. Sci. 381, No. 1--3, 241--247 (2007; Zbl 1188.68359) Full Text: DOI
Gandhi, Rajiv; Parthasarathy, Srinivasan Distributed algorithms for connected domination in wireless networks. (English) Zbl 1120.68113 J. Parallel Distrib. Comput. 67, No. 7, 848-862 (2007). MSC: 68W15 68W20 68Q25 PDFBibTeX XMLCite \textit{R. Gandhi} and \textit{S. Parthasarathy}, J. Parallel Distrib. Comput. 67, No. 7, 848--862 (2007; Zbl 1120.68113) Full Text: DOI
Han, Bo; Jia, Weijia Clustering wireless ad hoc networks with weakly connected dominating set. (English) Zbl 1118.68029 J. Parallel Distrib. Comput. 67, No. 6, 727-737 (2007). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{B. Han} and \textit{W. Jia}, J. Parallel Distrib. Comput. 67, No. 6, 727--737 (2007; Zbl 1118.68029) Full Text: DOI
Tsai, Yin-Te; Lin, Yaw-Ling; Hsu, F. R. Efficient algorithms for the minimum connected domination on trapezoid graphs. (English) Zbl 1116.68064 Inf. Sci. 177, No. 12, 2405-2417 (2007). MSC: 68R10 05C69 05C85 PDFBibTeX XMLCite \textit{Y.-T. Tsai} et al., Inf. Sci. 177, No. 12, 2405--2417 (2007; Zbl 1116.68064) Full Text: DOI
Min, Manki; Chinchuluun, Altannar Optimization in wireless networks. (English) Zbl 1118.90021 Resende, Mauricio G. C. (ed.) et al., Handbook of optimization in telecommunications. New York, NY: Springer (ISBN 0-387-30662-5/hbk). 891-915 (2006). MSC: 90B10 90C27 PDFBibTeX XMLCite \textit{M. Min} and \textit{A. Chinchuluun}, in: Handbook of optimization in telecommunications. New York, NY: Springer. 891--915 (2006; Zbl 1118.90021)
He, Yanxiang; Zeng, Yuanyuan Energy efficient connectivity maintenance in wireless sensor networks. (English) Zbl 1124.68321 Huang, De-Shuang (ed.) et al., Intelligent control and automation. International conference on intelligent computing, ICIC 2006, Kunming, China, August 16–19, 2006. Berlin: Springer (ISBN 3-540-37255-5/pbk). Lecture Notes in Control and Information Sciences 344, 95-105 (2006). MSC: 68M12 68M10 PDFBibTeX XMLCite \textit{Y. He} and \textit{Y. Zeng}, Lect. Notes Control Inf. Sci. 344, 95--105 (2006; Zbl 1124.68321)
Xu, Junming; Tian, Fang; Huang, Jia Distance irredundance and connected domination numbers of a graph. (English) Zbl 1113.05079 Discrete Math. 306, No. 22, 2943-2953 (2006). Reviewer: Reinhardt Euler (Brest) MSC: 05C69 PDFBibTeX XMLCite \textit{J. Xu} et al., Discrete Math. 306, No. 22, 2943--2953 (2006; Zbl 1113.05079) Full Text: DOI
Dai, Fei; Wu, Jie On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks. (English) Zbl 1101.68003 J. Parallel Distrib. Comput. 66, No. 7, 947-958 (2006). MSC: 68M10 PDFBibTeX XMLCite \textit{F. Dai} and \textit{J. Wu}, J. Parallel Distrib. Comput. 66, No. 7, 947--958 (2006; Zbl 1101.68003) Full Text: DOI
Wu, Weili; Du, Hongwei; Jia, Xiaohua; Li, Yingshu; Huang, Scott C.-H. Minimum connected dominating sets and maximal independent sets in unit disk graphs. (English) Zbl 1086.68107 Theor. Comput. Sci. 352, No. 1-3, 1-7 (2006). MSC: 68R10 05C69 68W25 PDFBibTeX XMLCite \textit{W. Wu} et al., Theor. Comput. Sci. 352, No. 1--3, 1--7 (2006; Zbl 1086.68107) Full Text: DOI
Ruan, Lu; Du, Hongwei; Jia, Xiaohua; Wu, Weili; Li, Yingshu; Ko, Ker-I A greedy approximation for minimum connected dominating sets. (English) Zbl 1086.68106 Theor. Comput. Sci. 329, No. 1-3, 325-330 (2004). MSC: 68R10 05C69 68W25 PDFBibTeX XMLCite \textit{L. Ruan} et al., Theor. Comput. Sci. 329, No. 1--3, 325--330 (2004; Zbl 1086.68106) Full Text: DOI
Soner, N. D.; Chaluvaraju, B. The connected double domination number of a graph. (English) Zbl 1243.05189 Acta Cienc. Indica, Math. 29, No. 2, 237-242 (2003). MSC: 05C69 PDFBibTeX XMLCite \textit{N. D. Soner} and \textit{B. Chaluvaraju}, Acta Cienc. Indica, Math. 29, No. 2, 237--242 (2003; Zbl 1243.05189)
Wan, Peng-Jun; Alzoubi, Khaled M.; Frieder, Ophir A simple heuristic for minimum connected dominating set in graphs. (English) Zbl 1075.68066 Int. J. Found. Comput. Sci. 14, No. 2, 323-333 (2003). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{P.-J. Wan} et al., Int. J. Found. Comput. Sci. 14, No. 2, 323--333 (2003; Zbl 1075.68066) Full Text: DOI
Chen, Yuanzhu Peter; Liestman, Arthur L. A zonal algorithm for clustering an hoc networks. (English) Zbl 1101.68950 Int. J. Found. Comput. Sci. 14, No. 2, 305-322 (2003). MSC: 68W05 68M10 PDFBibTeX XMLCite \textit{Y. P. Chen} and \textit{A. L. Liestman}, Int. J. Found. Comput. Sci. 14, No. 2, 305--322 (2003; Zbl 1101.68950) Full Text: DOI
Alzoubi, Khaled M.; Wan, Peng-Jun; Frieder, Ophir Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. (English) Zbl 1075.68624 Int. J. Found. Comput. Sci. 14, No. 2, 287-303 (2003). MSC: 68R10 05C85 68M10 PDFBibTeX XMLCite \textit{K. M. Alzoubi} et al., Int. J. Found. Comput. Sci. 14, No. 2, 287--303 (2003; Zbl 1075.68624) Full Text: DOI
Cheng, Xiuzhen; Huang, Xiao; Li, Deying; Wu, Weili; Du, Ding-Zhu A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. (English) Zbl 1031.05092 Networks 42, No. 4, 202-208 (2003). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{X. Cheng} et al., Networks 42, No. 4, 202--208 (2003; Zbl 1031.05092) Full Text: DOI Link
Duckworth, W. Minimum connected dominating sets of random cubic graphs. (English) Zbl 0986.05089 Electron. J. Comb. 9, No. 1, Research paper R7, 13 p. (2002); printed version J. Comb. 9, No. 1 (2002). MSC: 05C80 05C69 PDFBibTeX XMLCite \textit{W. Duckworth}, Electron. J. Comb. 9, No. 1, Research paper R7, 13 p. (2002; Zbl 0986.05089) Full Text: EuDML EMIS
Hartnell, Bert L.; Rall, Douglas F. Connected domatic number in planar graphs. (English) Zbl 1079.05512 Czech. Math. J. 51, No. 1, 173-179 (2001). MSC: 05C69 PDFBibTeX XMLCite \textit{B. L. Hartnell} and \textit{D. F. Rall}, Czech. Math. J. 51, No. 1, 173--179 (2001; Zbl 1079.05512) Full Text: DOI EuDML
Zwierzchowski, Maciej A note on domination parameters of the conjunction of two special graphs. (English) Zbl 1003.05080 Discuss. Math., Graph Theory 21, No. 2, 303-310 (2001). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{M. Zwierzchowski}, Discuss. Math., Graph Theory 21, No. 2, 303--310 (2001; Zbl 1003.05080) Full Text: DOI Link
Sanchis, Laura A. On the number of edges in graphs with a given connected domination number. (English) Zbl 0945.05046 Discrete Math. 214, No. 1-3, 193-210 (2000). Reviewer: Ludovit Niepel (Bratislava) MSC: 05C69 05C75 05C35 PDFBibTeX XMLCite \textit{L. A. Sanchis}, Discrete Math. 214, No. 1--3, 193--210 (2000; Zbl 0945.05046) Full Text: DOI
Köhler, Ekkehard Connected domination and dominating clique in trapezoid graphs. (English) Zbl 0944.05072 Discrete Appl. Math. 99, No. 1-3, 91-110 (2000). Reviewer: Ortrud R.Oellermann (Winnipeg) MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{E. Köhler}, Discrete Appl. Math. 99, No. 1--3, 91--110 (2000; Zbl 0944.05072) Full Text: DOI
Horrocks, David G. C. On the number of dependent sets in a connected graph. (English) Zbl 0994.05099 Ars Comb. 53, 239-247 (1999). Reviewer: Martin Klazar (Praha) MSC: 05C69 06A07 PDFBibTeX XMLCite \textit{D. G. C. Horrocks}, Ars Comb. 53, 239--247 (1999; Zbl 0994.05099)
Damian-Iordache, Mirela; Pemmaraju, Sriram V. Constant-factor approximation algorithms for domination problems on circle graphs. (English) Zbl 0964.05050 Aggarwal, Alok (ed.) et al., Algorithms and computation. 10th international symposium, ISAAC’ 99, Chennai, India, December 16-18, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1741, 70-82 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 68W25 05C85 68R10 05C62 PDFBibTeX XMLCite \textit{M. Damian-Iordache} and \textit{S. V. Pemmaraju}, Lect. Notes Comput. Sci. 1741, 70--82 (1999; Zbl 0964.05050)
Arumugam, S.; Joseph, J. Paulraj On graphs with equal domination and connected domination numbers. (English) Zbl 0933.05114 Discrete Math. 206, No. 1-3, 45-49 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 PDFBibTeX XMLCite \textit{S. Arumugam} and \textit{J. P. Joseph}, Discrete Math. 206, No. 1--3, 45--49 (1999; Zbl 0933.05114) Full Text: DOI
Acharya, B. D.; Gupta, Purnima On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets. (English) Zbl 0928.05049 Discrete Math. 195, No. 1-3, 1-13 (1999). MSC: 05C69 PDFBibTeX XMLCite \textit{B. D. Acharya} and \textit{P. Gupta}, Discrete Math. 195, No. 1--3, 1--13 (1999; Zbl 0928.05049) Full Text: DOI
Randerath, Bert; Volkmann, Lutz Characterization of graphs with equal domination and covering number. (English) Zbl 0955.05088 Discrete Math. 191, No. 1-3, 159-169 (1998). MSC: 05C75 05C69 05C40 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{L. Volkmann}, Discrete Math. 191, No. 1--3, 159--169 (1998; Zbl 0955.05088) Full Text: DOI
Wu, Zhengsheng; Xu, Xinping; Zhou, Xinghe The neighborhood intersections of essential sets and Hamiltonicity of graphs. (English) Zbl 0928.05040 Syst. Sci. Math. Sci. 11, No. 3, 230-237 (1998). MSC: 05C45 05C69 PDFBibTeX XMLCite \textit{Z. Wu} et al., Syst. Sci. Math. Sci. 11, No. 3, 230--237 (1998; Zbl 0928.05040)
Chang, Maw-Shang Efficient algorithms for the domination problems on interval and circular-arc graphs. (English) Zbl 0911.05051 SIAM J. Comput. 27, No. 6, 1671-1694 (1998). Reviewer: B.Zelinka (Liberec) MSC: 05C85 68Q25 68W10 68R10 90C27 PDFBibTeX XMLCite \textit{M.-S. Chang}, SIAM J. Comput. 27, No. 6, 1671--1694 (1998; Zbl 0911.05051) Full Text: DOI
Shan, Erfang; Sun, Liang; Kang, Liying Some results on domination number of products of graphs. (English) Zbl 0904.05048 Appl. Math., Ser. B (Engl. Ed.) 13, No. 1, 103-108 (1998). Reviewer: B.Zelinka (Liberec) MSC: 05C35 PDFBibTeX XMLCite \textit{E. Shan} et al., Appl. Math., Ser. B (Engl. Ed.) 13, No. 1, 103--108 (1998; Zbl 0904.05048) Full Text: DOI
Guha, S.; Khuller, S. Approximation algorithms for connected dominating sets. (English) Zbl 0895.68106 Algorithmica 20, No. 4, 374-387 (1998). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{S. Guha} and \textit{S. Khuller}, Algorithmica 20, No. 4, 374--387 (1998; Zbl 0895.68106) Full Text: DOI
Arseneau, L.; Finbow, A.; Hartnell, B.; Hynick, A.; MacLean, D.; O’Sullivan, L. On minimal connected dominating sets. (English) Zbl 0880.05052 J. Comb. Math. Comb. Comput. 24, 185-191 (1997). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C05 PDFBibTeX XMLCite \textit{L. Arseneau} et al., J. Comb. Math. Comb. Comput. 24, 185--191 (1997; Zbl 0880.05052)
Dunbar, Jean E.; Grossman, Jerrold W.; Hattingh, Johannes H.; Hedetniemi, Stephen T.; McRae, Alice A. On weakly connected domination in graphs. (English) Zbl 0871.05037 Discrete Math. 167-168, 261-269 (1997). MSC: 05C35 PDFBibTeX XMLCite \textit{J. E. Dunbar} et al., Discrete Math. 167--168, 261--269 (1997; Zbl 0871.05037) Full Text: DOI
Sridhar, R.; Chandrasekharan, N. Highly parallelizable problems on sorted intervals. (English) Zbl 0875.68316 Parallel Comput. 21, No. 3, 433-446 (1995). MSC: 68P10 PDFBibTeX XMLCite \textit{R. Sridhar} and \textit{N. Chandrasekharan}, Parallel Comput. 21, No. 3, 433--446 (1995; Zbl 0875.68316) Full Text: DOI
Hattingh, Johannes H.; Henning, Michael A. Distance irredundance in graphs. (English) Zbl 0843.05058 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 529-541 (1995). MSC: 05C35 05C12 PDFBibTeX XMLCite \textit{J. H. Hattingh} and \textit{M. A. Henning}, in: Graph theory, combinatorics, algorithms and applications. Vol. 1. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 529--541 (1995; Zbl 0843.05058)
Sanchis, Laura A. Some results on characterizing the edges of connected graphs with a given domination number. (English) Zbl 0843.05064 Alavi, Y. (ed.) et al., Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1021-1032 (1995). MSC: 05C35 05C75 PDFBibTeX XMLCite \textit{L. A. Sanchis}, in: Graph theory, combinatorics, algorithms and applications. Vol. 2. Proceedings of the seventh quadrennial international conference on the theory and applications of graphs, Kalamazoo, MI, USA, June 1-5, 1992. New York, NY: Wiley. 1021--1032 (1995; Zbl 0843.05064)
Li, Jianping Cycles containing all vertices in \(V_ r(G)\). (English) Zbl 0837.05077 J. China Univ. Sci. Technol. 25, No. 1, 78-81 (1995). Reviewer: R.Scapellato (Milano) MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{J. Li}, J. China Univ. Sci. Technol. 25, No. 1, 78--81 (1995; Zbl 0837.05077)
Penrice, Stephen G. Clique-like dominating sets in perfect graphs. (English) Zbl 0905.05041 Congr. Numerantium 110, 77-82 (1995). MSC: 05C35 PDFBibTeX XMLCite \textit{S. G. Penrice}, Congr. Numerantium 110, 77--82 (1995; Zbl 0905.05041)
Ghoshal, J.; Laskar, R.; Pillone, D. Connected domination and c-irredundance. (English) Zbl 0897.05051 Congr. Numerantium 107, 161-171 (1995). MSC: 05C35 PDFBibTeX XMLCite \textit{J. Ghoshal} et al., Congr. Numerantium 107, 161--171 (1995; Zbl 0897.05051)
Sampathkumar, E.; Pushpa Latha, L. The global set-domination number of a graph. (English) Zbl 0824.05038 Indian J. Pure Appl. Math. 25, No. 10, 1053-1057 (1994). Reviewer: M.Hager (Leonberg) MSC: 05C35 05C40 PDFBibTeX XMLCite \textit{E. Sampathkumar} and \textit{L. Pushpa Latha}, Indian J. Pure Appl. Math. 25, No. 10, 1053--1057 (1994; Zbl 0824.05038)
Joseph, J. Paulraj; Arumugam, S. On the connected domatic number of a graph. (English) Zbl 0809.05088 J. Ramanujan Math. Soc. 9, No. 1, 69-77 (1994). Reviewer: C.-Q.Zhang (Morgantown) MSC: 05C99 05C70 PDFBibTeX XMLCite \textit{J. P. Joseph} and \textit{S. Arumugam}, J. Ramanujan Math. Soc. 9, No. 1, 69--77 (1994; Zbl 0809.05088)
Ibarra, Oscar H.; Zheng, Qi Some efficient algorithms for permutation graphs. (English) Zbl 0804.68102 J. Algorithms 16, No. 3, 453-469 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{O. H. Ibarra} and \textit{Q. Zheng}, J. Algorithms 16, No. 3, 453--469 (1994; Zbl 0804.68102) Full Text: DOI
Joseph, J. Paulraj; Arumugam, S. On connected cutfree domination in graphs. (English) Zbl 0772.05054 Indian J. Pure Appl. Math. 23, No. 9, 643-647 (1992). Reviewer: J.Ebert (Koblenz) MSC: 05C35 05C99 PDFBibTeX XMLCite \textit{J. P. Joseph} and \textit{S. Arumugam}, Indian J. Pure Appl. Math. 23, No. 9, 643--647 (1992; Zbl 0772.05054)
Müller, Haiko; Brandstädt, Andreas The NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. (English) Zbl 0598.05028 Forschungsergeb., Friedrich-Schiller-Univ. Jena N/86/32, 14 pp. (1986). MSC: 05C05 68R10 68Q25 05C99 PDFBibTeX XML
White, Kevin; Farber, Martin; Pulleyblank, William Steiner trees, connected domination and strongly chordal graphs. (English) Zbl 0579.05050 Networks 15, 109-124 (1985). MSC: 05C99 68R10 05C05 PDFBibTeX XMLCite \textit{K. White} et al., Networks 15, 109--124 (1985; Zbl 0579.05050) Full Text: DOI
Hedetniemi, S. T.; Laskar, Renu Connected domination in graphs. (English) Zbl 0548.05055 Graph theory and combinatorics, Proc. Conf. Hon. P. Erdös, Cambridge 1983, 209-217 (1984). Reviewer: J.Širáň MSC: 05C99 PDFBibTeX XML
Lichtenstein, David Planar formulae and their uses. (English) Zbl 0478.68043 SIAM J. Comput. 11, 329-343 (1982). MSC: 68Q25 68R10 03D15 03B10 PDFBibTeX XMLCite \textit{D. Lichtenstein}, SIAM J. Comput. 11, 329--343 (1982; Zbl 0478.68043) Full Text: DOI
Sampathkumar, E.; Walikar, H. B. The connected domination number of a graph. (English) Zbl 0449.05057 J. Math. Phys. Sci. 13, 607-613 (1979). MSC: 05C75 PDFBibTeX XMLCite \textit{E. Sampathkumar} and \textit{H. B. Walikar}, J. Math. Phys. Sci. 13, 607--613 (1979; Zbl 0449.05057)