Dominating cliques in distance-hereditary graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 824 LNCS, Issue , 1994, Pages 370-381

  Dragan, Feodor F ^a  

^a MOLDOVA STATE UNIVERSITY   (Moldova)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE-HEREDITARY; DISTANCE-HEREDITARY GRAPHS; LINEAR-TIME ALGORITHMS; SET PROBLEMS;

CLUSTERING ALGORITHMS;

EID: 0347622807     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58218-5_34     Document Type: Conference Paper

References (16)

1. H.-J. BANDBLT, A. HBNKMANN, and F. NICOLAI Powers of distance-hereditary graphs, Technical Report SM-DU-220, University Duisburg 1993.
2. H.-J. BANDBLT, A and H.M. MULDER, Distance-hereditary graphs, J. Comb. Theory Set. B, 41 (1986) 182-208.
3. H.-J. BANDBLT, A and H.M. MULDER, Pseudo-modular graphs, Discrete Math., 62 (1986) 245-260.
4. A. BRANDSTÄDT, Special graph classes - a survey, Technical Report SM-DU-199, University Duisburg 1993.
5. A. BRANDSTÄDT, F.F. DRAGAN, V.D. CHEPOI, and V.I. VOLOSHIN, Dually chordal graphs, Technical Report SM-DU-225, University of Duisburg 1993, to appear as extended abstract in the proceedings of WG’93, (ed. J. vaJt Leeuwen), Utrecht, The Netherlands, submitted to SIAM J. Discr. Math.
6. A. BRANDSTÄDT and D. KRATSOH, Domination problems on permutation and other graphs, Theoretical Computer Science, 54 (1987) 181-198.
7. G.J. CHANO, Centers of chordal graphs, Graphs and Combinatorics, 7 (1991) 305-313.
8. A. D’ATRI and M. MOSCARINI, Distance-hereditaxy graphs, Steiner trees and connected domination, SIAM J. Computing, 17 (1988) 521-538.
9. F.F. DRAGAN and A. BRANDSTÄDT, r-Dominating cliques in Helly graphs and chordal graphs, Technical Report SM-DU-228, University Duisburg 1993, Proc. of the 11th STACS, Caen, France, Springer, LNCS 775, 735-746, 1994
10. M.C. GOLUMBIO, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
11. P.L. HAMMER and F. MAFFRAY, Completely sepaxable graphs, Discrete Appl. Math., 27 (1990) 85-99.
12. S.C. HEDETNIEMI and R. LASKAR, (eds.), Topics on Domination, Annals of Discr. Math. 48, North-Holland, 1991.
13. E. HOWORKA, A characterization of distance-hereditaxy graphs, Quart. J. Math. Oxford Ser. 2, 28 (1977) 417-420.
14. D. KRATSCH, Finding dominating cliques efficiently in strongly chordal graphs and undirected path graphs, Annals of Discr. Math. 48, Topics on Domination, (S.C. Hedetniemi, R. Laskar, eds.), 225-238.
15. D. KRATSCH, P. DAMASCHKE and A. LUBIW, Dominating cliques in chordal graphs, to appear in Discrete Mathematics.
16. S.V. YUSHMANOV and V.D. CHBPOI, A general method of investigation of characteristic of graphs related with eccentricity Math. Problems of Cybernetics, Moscow 3 1991 217-232 (Russian, English transl.)