Skip to main content
SpringerLink
Log in

Domination in quadrangle-free helly graphs

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco (1979).

    Google Scholar 

  2. D. V. Korobitsyn, "On complexity of determining the domination number in monogenic classes of graphs," Diskr. Mat.,2, No. 3, 90–96 (1990).

    Google Scholar 

  3. H. Muller and A. Brandstadt, "TheNP-completeness of Steiner tree and dominating set for chordal bipartite graphs," Theor. Comput. Sci.,54, No. 2–3, 257–265 (1987).

    Google Scholar 

  4. K. S. Booth and J. H. Johnson, "Dominating sets in chordal graphs," SIAM J. Comput.,11, No. 1, 191–199 (1982).

    Google Scholar 

  5. F. F. Dragan, K. F. Prisakar’, and V. D. Chepoi, "Location problems on graphs and the Helly property," Diskr. Mat.,4, No. 4, 67–73 (1992).

    Google Scholar 

  6. D. G. Corneil and L. K. Stewart, "Dominating sets in perfect graphs," Discrete Math.,86, No. 1–3, 145–164 (1990).

    Google Scholar 

  7. E. J. Cockayne, S. Goodman, and S. T. Hedetniemi, "A linear algorithm for the domination number of a tree," Inf. Proc. Lett.,4, No. 1, 71–76 (1975).

    Google Scholar 

  8. P. J. Slater, "r-Domination in graphs," J. ACM,23, No. 4, 446–450 (1976).

    Google Scholar 

  9. T. Kikuno, N. Yoshida, and Y. Kokudo, "A linear algorithm for the domination number of a serial-parallel graph," Discrete Appl. Math.,5, No. 3, 299–311 (1983).

    Google Scholar 

  10. M. Farber and J. M. Keil, "Domination in permutation graphs," J. Algorithms,6, No. 3, 309–321 (1985).

    Google Scholar 

  11. S. T. Hedetniemi, R. Laskar, and J. Pfaff, "A linear algorithm for finding a minimum dominating set in a cactus," Discrete Appl. Math.,13, No. 2–3, 287–292 (1986).

    Google Scholar 

  12. M. A. Bonuccelli, "Dominating sets and domatic number of circular arc graphs," Discrete Appl. Math.,12, No. 3, 203–213 (1985).

    Google Scholar 

  13. D. G. Corneil and Y. Perl, "Clustering and domination in perfect graphs," Discrete Appl. Math.,9, No. 1, 27–39 (1984).

    Google Scholar 

  14. M. Farber, "Domination, independent domination, and duality in strongly chordal graphs," Discrete Appl. Math.,7, No. 2, 115–130 (1984).

    Google Scholar 

  15. M. Farber, "Characterization of strongly chordal graphs," J. Algorithms,43, No. 2–3, 173–189 (1983).

    Google Scholar 

  16. G. J. Chang and G. L. Nemhauser, "Thek-domination andk-stability problems on sun-free chordal graphs," SIAM J. Algor. Discr. Meth.,5, No. 3, 332–345 (1984).

    Google Scholar 

  17. G. J. Chang and G. L. Nemhauser, "Covering, packing and generalized perfection," SIAM J. Algor. Discr. Meth.,6, No. 1, 109–132 (1985).

    Google Scholar 

  18. R. B. Hayward, "Weakly triangulated graphs," J. Combin. Theory,B39, No. 3, 200–208 (1985).

    Google Scholar 

  19. D. J. Rose, R. E. Tarjan, and G. S. Lueker, "Algorithmic aspects of vertex elimination on graphs," SIAM J. Comput.,5, No. 2, 266–283 (1976).

    Google Scholar 

  20. F. F. Dragan, Centers in Graphs and the Helly Property [in Russian], thesis, Minsk (1989).

  21. M. Grotschel, L. Lovasz, and A. Schrijver, "Polynomial algorithms for perfect graphs," Ann. Discr. Math.,21, 325–356 (1984).

    Google Scholar 

  22. F. F. Dragan, "Domination and packing in triangulated graphs," Sbornik Trudov Inst. Matem. SO Akad. Nauk SSSR, No. 51, 17–36 (1991).

    Google Scholar 

  23. F. F. Dragan, "r-Domination problem in chordal graphs," Abstracts of the International Conference on Sets, Graphs, and Numbers, 21–26 Jan. 1991, Budapest, Janos Bolyai Math. Soc. (1991), p. 9.

  24. G. J. Chang, "Labeling algorithms for domination problems in sunfree chordal graphs," Discrete Appl. Math.,22, No. 1, 21–23 (1988/89).

    Google Scholar 

  25. M. Farber, "Bridged graphs and geodesic convexity," Discrete Math.,66, No. 3, 249–257 (1987).

    Google Scholar 

  26. H.-J. Bandelt and H. M. Mulder, "Pseudo-modular graphs," Discrete Math.,62, No. 3, 245–260 (1986).

    Google Scholar 

  27. H.-J. Bandelt and E. Pesch, "Dismantling absolute retracts of reflexive graphs," Eur. J. Combin.,10, No. 3, 211–220 (1989).

    Google Scholar 

  28. F. F. Dragan, "Conditions when the local and the global minima of the eccentricity function are identical on graphs and the Helly property," in: Studies in Applied Mathematics and Informatics [in Russian], Kishenev (1990), pp. 49–56.

Download references

Authors
  1. F. F. Dragan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

In memory of Martin Farber

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 47–57, November–December, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dragan, F.F. Domination in quadrangle-free helly graphs. Cybern Syst Anal 29, 822–829 (1993). https://doi.org/10.1007/BF01122734

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01122734

Keywords

Search

Navigation