BIBLIOGRAFIE
[1] Aho, Hopcroft and Ullman, The Design and Analysis of Computer’s Algorithms, Addison Wesley, 1975. [2] L. Babel, S. Olariu, On the Structure of Graphs with Few P4s, Work supported by NSF grants CCR-9407180 and CCR-95-22093, as well as by ONR grandt N00014-1-95-0779, Discrete Applied Mathematics, 1998. [3] T. Bălănescu, Corectitudinea algoritmilor, Editura Tehnică, Bucureşti, 1995. [4] M. Behzad, G. Chartand, L. L. Foster, Graphs and Digraphs, Prindle, Weber & Schmidt International Series, 1973. [5]
C. Berge, Graphs (Nort-Holland, Amsterdam, 1985).
[6] V. Chvatal, Perfectly orderable graphs in "Topics on Perfect Graphs" (C. Berge and V. Chvatal), Ann. Discrete Math.21(1984), 63-65. [7] V. Chvatal, Star – cutest and Perfect Graphs, Journal of Comb. Th., B, 39, 189-199 (1985). [8] E. Ciurea, Algoritmi. Introducere în algoritmica grafurilor, Editura Tehnică, Bucureşti, 2001. [9] E. Ciurea, L. Ciupală, Algoritmi. Introducere în algoritmica fluxurilor în reţele, Editura MATRIXROM, Bucureşti, 2006. [10] T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introducere în algoritmi (traducere), Computer Libris Agora, 2000. [11] D. G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement Reductible Graphs, Discrete Appl. Math. 3(1981), pp.163-174. [12] D. G. Corneil, D. G. Kirkpatrick, Families of recursively defined perfect graphs, Congr. Numer., 39(l983), 237-246.
121
[13] D. G. Corneil, Y. Perl, L. K. Stewart, A linear recognition algorithmic for cographs, SIAM.J. Comput., 14(l985), 926-934. [14] C. Croitoru, Tehnici de bază în optimizarea combinatorie, Editura Universităţii "Al. I. Cuza", Iaşi, 1992. [15] C. Croitoru, M. Talmaciu, A new graph search algorithm and some applications, presented at ROSYCS 2000, Universitatea "Al.I.Cuza", Iaşi, 2000. [16] E. Dahlhaus, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, Discrete Applied Mathematics 57(1995), 29-44. [17] G. A. Dune, Generalisation du theoreme de Menger, C. R. Acad. Sci. Paris 250 (26) (1960), 4252-4253. [18] H. Georgescu, Tehnici de programare, Editura Universităţii din Bucreşti, 2005. [19] M. C. Golumbic, Algorithmic Graphs Theory and Perfect Graphs, Academic Press 1980. [20] F. Harary, On the number of bicolored graphs, Pacific J. Math. 8(1958), 743-755. [21] X. He, Parallel Algorithm for Cograph Recognition With Applications, in: O. Nurmi and E. Ukkonen eds. AIgorithm Theory-SWAT '92, Lecture Notes in Computer Science 621 (Springer Berlin 1992), 94-105. [22] B. Jamison and S. Olariu, On the clique-kernel structure of graphs, Department of Computer Science, University of' Toronto, Toronto, Ontario, Octobre,1972. [23] B. Jamison, S. Olariu, A tree representation for P4 sparse graphs, Discrete Appl. Math., 35(1992), 115-129, North-Holland. [24] B. Jamison, S. Olariu, P-components and the homogeneous decomposition of graphs, SIAM J. DISC. MATH. Vol. 8, No.3, 448463,1995. [25] D. Knuth, Arta programării calculatoarelor, Editura Teora, Bucureşti, 2002.
122
[26] H. Lerchs, On clique-kernel structure of graphs, Department of Computer Science, University of Toronto, Toronto, Ontario, October 1972. [27] R. Lin, S. Olariu, An Nc Recognition Algorithm for Cographs, Journal of Parallel and Distributed Computing, 13, 76-90 (1991). [28] L. Livovschi, H. Georgescu, Sinteza şi analiza algoritmilor, Editura Ştiinţifică, Bucureşti, 1986. [29] R. H. Mohring, F. J. Radamacher, Substitution decomposition and connections with combinatorial optimization, Ann. Discrete Math. 19(1984), 257-266. [30] J. A. Nash-Williams, Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, L. Musky, ed ., Studies in pure mathematics (papers presented to Richard Ratio), (Academic Press, New York. 1971). [31] I. Odagescu, C. Copos, D. Luca, F. Furtuna, I. Smeureanu, Metode şi tehnici de programare, Editura Intact, Bucureşti, 1994. [32] E. Olaru, On strongly stable graphs and some consequences for partitionable graphs, Analele Ştiintifice ale Universităţii "Al.I.Cuza" din Iaşi, Tomul VII, 1998, 33-41. [33] E. Olaru, On strongly perfect graphs and the structure of criticallyimperfect graphs, Ştiintifice ale Universităţii "Al.I.Cuza" din Iaşi, Tomul II, Informatică, 1993. [34] E. Olaru, Some results on a-partitionable graphs and perfect graphs, Analele Univ. D. de Jos Galaţi, Fascicola II, Supliment la tomul XVI/(XXI) 1998, Vol. I, Matematica, 171-185. [35] E. Olaru, Introducere în teoria grafurilor, Univ. "Al.I.Cuza" Iaşi,1975. [36] E. Olaru, St. Antohe, Decomposition with respect to the graph-join operation, Analele Universităţii din Galaţi, fascicula II, I(VI)(1983), 15- 26. [37] E. Olaru, S. Antohe, Some results concerning graphs decomposition, Analele Universităţii din Galaţi, Matematică, Fascicula II, Anul III(VIII)1985.
123
[38] E. Olaru, Gh. Suciu, Dauerstabile und Kritisch imperfekte Graphen, An.Univ. Timişoara, vol. XVII, fasc.l, 1970, 59-64. [39] E. Olaru, α - Zerlegbare Graphen, Bul. Univ. Galati, fasc.II, 1980, 39-45. [40] St. Olariu, On the closure of triangle-free graphs under substitution, Information Processing Letters 34(1990), 97-101. [41] O. Pătraşcoiu, Gh. Marian, N. Mitroi, Elemente de grafuri şi combinatorică. Metode, algoritmi şi programe, Editura All, Bucureşti, 1994. [42]
G. Sabidussi, Graph derivatives, Math, Z76(l 961), 385-401.
[43] G. Sabidussi, The composition of graph, Duke Math. J. 26 (1959), 693-696. [44] G. Sabidussi, The lexicographic product of graphs, Duke Math. J. 28 (1961), 573-578. [45] R. Shamir, Advanced Topics in Graph Algorithms, Tehnical Reports, Tel – Aviv. University, Sprin 1994. [46] D. Summer, Graphs indecomposable with respect to the X-join, Discrete Math. 6(1973), 281-298. [47] I. Tomescu, Probleme de combinatorică şi teoria grafurilor, Editura Didactică şi Enciclopedică, Bucureşti, 1981. [48] W. Wessel, Some color-critical equivalents of the strong perfect graph conjecture, in Beitrage zur Graphentbeorie und deren Anwendungen, Obezhof (DDR), 10-16 April 1977, 300-309. [49] R. Yuster, Independent Transversals in r-partit graphs, Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel, (electronic), 2001. [50] R. Yuster, Independent Transversals and Independent Coverings in Sparse Partite Graphs, Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel, (electronic), 2001.
124
