Ioan Tomescu
Email: tomescu@sms.edu.pk
Course: Graph Theory & Combinatorics
Publications
1] I. Tomescu[To04a]. Sunflower hypergraphs are chromatically unique, Discrete Mathematics, 285(2004), 355-357.
2] I. Tomescu[To03a]. On the number of occurrences of all short factors in almost all words, Theoretical Computer Science, 290(2003), 2031-2035.
3] I. Tomescu[To03b]. Maximal s-polynomials of connected 3-chromatic graphs, J. Graph Theory, 43(2003), 210-222.
4] I. Tomescu[To02a]. On the chromatic coefficients of graphs with dense neighborhoods, Math. Reports, 4(54), 3(2002), 295-299.
5] I. Tomescu[To02b]. On the number of h-connected graphs with a fixed diameter, Discrete Mathematics, 252(2002), 279-285.
6] I. Tomescu[To02c]. On the maximum number of irreducible coverings of an n-vertex graph by n - 3 cliques, Computing and Combinatorics, Proceedings, 8th Annual Int. Conf., COCOON 2002, Singapore, August 2002, Oscar H. Ibarra, Louxin Zhang (Eds.), LNCS 2387, Springer (2002), 544-553.
7] I. Tomescu[To02d]. Irreducible coverings by cliques and Sperner’s theorem, The Electronic Journal of Combinatorics, Vol. 9(1)(2002), paper N11 (4 pag.).
8] D. Andrica, I. Tomescu[AnTo02]. On an integer sequence related to a product of trigonometric functions, and its combinatorial relevance, Journal of Integer Sequences, Vol. 5(2002), article 02.2.4 (8 pag.).
9] I. Tomescu[To01a]. On the number of graphs and digraphs
with a fixed diameter and connectivity, Combinatorics, Computability and Logic,
Proceedings of the Third International Conference on Combinatorics, Computability
and Logic (DMTCS’01), Springer-Verlag, 2001, 33-46.
10] I. Tomescu[To01b]. A cascade version of Dantzig’s inductive algorithm for matrices over semilattice-ordered semigroups, Multiple Valued Logic 6, 1-2(2001), 217-228.
11] I. Tomescu[To01c]. On the number of graphs and h-hypergraphs with bounded diameter, Discrete Mathematics 235(2001), 291-299.
12] I. Tomescu[To01d]. The number of h-strongly connected digraphs with small diameter, Australasian Journal of Combinatorics 24(2001), 305-311.
13] I. Tomescu[To01e]. Extremal properties of the chromatic polynomials of connected 3-chromatic graphs, Matematicki Vesnik, 53, 3-4(2001), 111-116.
14] I. Tomescu[To00a]. On the number of large h-hypergraphs with a fixed diameter, Discrete Mathematics 223(2000), 287-297.
15] I. Tomescu[To99a ]. Some extremal properties of the degree distance of a graph, Discrete Applied Mathematics 98(1999), 159-163. Monograph “ Interaction of the person with computer environment”. 1997, Moscow, Russian Academy of education, 360p. (co-authorship).
16. I. Tomescu[To98a]. On words containing all short
subwords, Theoretical
Computer Science 197(1998), 235-240.
17] I. Tomescu[To98b]. A threshold property concerning words containing all short factors, Bulletin of the EATCS no.64(1998), 166-170.
18] I. Tomescu[To98c]. Chromatic coefficients of linear uniform hypergraphs, Journal of Combinatorial Theory Series B, Vol. 72, No. 2(1998), 229-235.
19] C. S. Calude, I. Tomescu[CaTo97]. Optimum extendible prefix codes, Journal of Universal Computer Science Vol. 3 No. 11(1997), 1167-1179.
20] I. Tomescu[To97a]. Maximum chromatic polynomial of 3-chromatic blocks, Discrete Mathematics 172(1997), 131-139.
21] I. Tomescu[To97b]. Optimum Huffman forests, Journal of Universal Computer Science Vol. 3 No. 7(1997), 813-820.
22] I. Tomescu[To97c]. On the number of trees having k edges in common with a graph of bounded degree, Discrete Mathematics 169(1997), 283-286.
23] I. Tomescu[To96a]. On the asymptotic average length of a maximum common subsequence for words over a finite alphabet, Theoretical Computer Science 164(1996), 277-285.
24] I. Tomescu[To96b]. An asymptotic formula for the number of graphs having small diameter, Discrete Mathematics 156(1996), 219-228.
25] I. Tomescu[To96c]. The number of digraphs with small diameter, Australasian J. Combinatorics 14(1996), 221-227.
26] D. Popescu, I. Tomescu[PoTo96a]. Negative cycles in complete signed graphs, Discrete Applied Mathematics 68(1996), 145-152.
27] D. Popescu, I. Tomescu[PoTo96b]. Bonferroni inequalities and negative cycles in large complete signed graphs, Europ. J. Combinatorics 17(1996), 479-483.
28] I. Tomescu[To96d]. On the number of irreducible coverings by edges of complete bipartite graphs, Discrete Mathematics 150(1996), 453-456.
29] I. Tomescu[To94a]. Maximum chromatic polynomials of 2-connected graphs, J. Graph Theory 4, 18(1994), 329-336.
30] I. Tomescu[To94b]. On the sum of all distances in chromatic blocks, J. Graph Theory 1, 18(1994), 83-102.
31] I. Tomescu[To94c]. On the number of subtrees for almost all graphs, Random Structures and Algorithms 1, 5(1994), 205-213.
32] I. Tomescu, M. Zimand[ToZi94]. Minimum spanning hypertrees, Discrete Applied Mathematics 54(1994), 67-76.
33] I. Tomescu[To94d]. On the number of graphs having small diameter, Rev. Roumaine Math. Pures Appl. 2, 39(1994), 171-177.
34] I. Tomescu[To92a]. Ordered h-hypertrees, Discrete Mathematics 105(1992), 241-248.
35] I. Tomescu[To90a]. On the number of colorings of p-connected hypergraphs, An. Univ. Bucure¸sti, Mat.-Inf. 3, 39-40(1990-1991), 98-101.
36] I. Tomescu[To90b]. Almost all digraphs have a kernel, Discrete Mathematics 84(1990), 181-192; reprinted in: Random Graphs ’87, Ed. by M. Karonski, J. Jaworski and A. Rucinski, J. Wiley, 1990, 325-340.
37] I. Tomescu[To90c]. Maximal chromatic polynomials of connected planar graphs, J. Graph Theory 1, 14(1990), 101-110.
38] I. Tomescu, R. A. Melter[ToMe89]. On distances in chromatic graphs, Quart. J. Math. Oxford (2) 40(1989), 475-480.
39] I. Tomescu[To89a]. Decomposition theorems for the number of perfect matchings in hexagonal graphs, Rostock. Math. Kolloq. 38(1989), 15-24.
40] I. Tomescu, A. T. Balaban[ToBa89]. Decomposition theorems for calculating the number of Kekul´e structures in coronoids fused via perinaphthyl units, Comm. Math. Chem. (MATCH) 24(1989), 289-309.
41] A. T. Balaban, I. Tomescu[BaTo89]. Alternating 6-cycles in perfect matchings of graphs representing condensed benzenoid hydrocarbons, Discrete Appl. Math. 19(1988), 5-16; reprinted in: Applications of graphs in physics and chemistry, North-Holland, 1989.
42] I. Tomescu[To87a]. On 3-colorings of bipartite p-threshold graphs, J. Graph Theory 3, 11(1987), 327-338.
43] C. Artemi, A. T. Balaban, I. Tomescu[ArBaTo87]. Algebraic expressions for Kekulé structure counts of non-branched regularly cata-condensed benzenoid hydrocarbons, Comm. Math. Chem. (MATCH) 22(1987), 77-100.
44] I. Tomescu[To87b]. Graphical Eulerian numbers and chromatic generating functions, Discrete Mathematics 66(1987), 315-318.
45] I. Tomescu[To86a]. Hypertrees and Bonferroni inequalities, J. Combinatorial Theory 2, B41(1986), 209-217.
46] I. Tomescu[To86b]. The number of paths and circuits for almost all complete digraphs, An. Univ. Bucuresti, Mat. 35(1986), 72-78.
47] I. Tomescu[To86c]. On hypergraph colourings, Quart. J. Math. Oxford(2) 37(1986), 239-243.
48] I. Tomescu[To86d]. On the number of paths and cycles for almost all graphs and digraphs, Combinatorica 1, 6(1986), 73-79.
49] A. T. Balaban, I. Tomescu[BaTo85]. Chemical graphs. XLI. Numbers of conjugated circuits and Kekulé structures for zigzag catafusenes and (j, k)- hexes;Generalized Fibonacci numbers, Comm. Math. Chem. (MATCH) 17(1985), 91-120.
50] A. T. Balaban, I. Tomescu[BaTo84]. Chemical graphs. XL. Three relations between the Fibonacci sequence and the numbers of Kekulé structures for non-branched cata-condensed polycyclic aromatic hydrocarbons, Croatica Chemica Acta, 3, 57(1984), 391-404.
51] I. Tomescu[To84a]. A Hamiltonian connectivity property of regular graphs with forbidden subgraphs, Quart. J. Math. Oxford(2) 35(1984), 507-512.
52] I. Tomescu[To84b]. A Hamiltonian property of regular graphs, Rev. Roumaine Math. Pures Appl. 6, 29(1984), 499-505.
53] I. Tomescu[To84c]. Colorings and irreducible coverings by cliques of graphs and hypergraphs, An. Univ. Galat¸i Metal. 2(7), 2(1984), 15-20.
54] R. A. Melter, I. Tomescu[MeTo84a]. On the Boolean metric dimension of a graph, Rev. Roumaine Math. Pures Appl. 5, 29(1984), 407-415.
55] F. Harary, R. A. Melter, I. Tomescu[HaMeTo84]. Digital metrics: A graph-theoretical approach, Pattern Recognition Letters 2(1984), 159-163.
56] R. A. Melter, I. Tomescu[MeTo84b]. Metric bases in digital geometry, Computer Vision, Graphics, and Image Processing 25(1984), 113-121.
57] I. Tomescu[To83a]. On Hamiltonian-connected regular graphs, J. Graph Theory 7(1983), 429-436.
58] I. Tomescu[To83b]. An upper bound for the shortest Hamiltonian path in the symmetric Euclidean case, RAIRO Rech. Op´erat. 3, 17(1983), 297-306.
59] A. T. Balaban, I. Tomescu[BaTo83]. Algebraic expressions for the number of Kekulé structures of isoarithmic cata-condensed benzenoid polycyclic hydrocarbons, Comm. Math. Chem. (MATCH) 14(1983), 155-182.
60] R. A. Melter, I. Tomescu[MeTo83]. Path generated digital metrics, Pattern Recogn. Lett. 1(1983), 151-154.
61] F. Harary, R. A. Melter, U. N. Peled, I. Tomescu[HaMePeTo82]. Boolean distance for graphs, Discrete Mathematics 39(1982), 123-127.
62] R. A. Melter, I. Tomescu[MeTo81]. Isometric embeddability for graphs, Ars Combinatoria 12(1981), 111-115.
63] I. Tomescu[To81a]. On the chromatic number of almost all graphs, Bull. Math. Soc. Sci. Math. Roumanie(N. S. ) 25(73)(1981), 321-323.
64] I. Tomescu[To81b]. The maximum number of cliques and of coverings by cliques of complete chromatic hypergraphs, Discrete Mathematics 37(1981), 263-277. (in French)
65] R. A. Melter, I. Tomescu[MeTo81]. Remarks on distances in graphs, An. Stiin. Univ. ”Alex. I. Cuza”, Iasi, Sect. I Mat. 2, 27(1981), 407-410.
66] I. Tomescu[To81c]. Asymptotic estimations of the number of cliques of uniform hypergraphs, Calcolo 1, 18(1981), 1-17. (in French)
67] I. Tomescu[To81d]. On the number of connected h-hypergraphs, Rev. Roumaine Math. Pures Appl. 2, 26(1981), 331-337.
68] I. Tomescu[To80a]. Almost all graphs are h-connected, Rev. Roumaine Math. Pures Appl. 7, 25(1980), 1125-1130. (in French)
69] I. Tomescu[To80b]. Some properties of irreducible coverings by cliques of complete multipartite graphs, J. Combinatorial Theory 2, B28(1980), 127-141.
70] I. Tomescu[To79a]. The maximum number of edge-colorings of a graph, Rev. Roumaine Math. Pures Appl. 5, 24(1979), 811-816. (in French)
71] I. Tomescu[To79b]. On a Zarankiewiczs theorem, St. Cerc. Mat. 3, 31(1979), 353-358. (in Romanian)
72] I. Tomescu[To79c]. The minimum number of colorings of a k-chromatic hypergraph, Discrete Mathematics 2, 25(1979), 179-188. (in French)
73] I. Tomescu[To78a]. On the cycles in k-chromatic graphs and hypergraphs, Calcolo 1, 15(1978), 1-15. (in French)
74] I. Tomescu[To78b]. A general formula for the asymptotic number of labeled connected graphs and digraphs, Rev. Roumaine Math. Pures Appl. 4, 23(1978), 617-623.
75] I. Tomescu[To77a]. On the longest cycles in chromatic graphs, Bull. Math. Soc. Sci. Math. Roumanie (N. S. ) 3-4, 21(69)(1977), 433-439. (in French)
76] I. Tomescu[To76a]. Some extremal properties of uniform hypergraphs, St. Cerc. Mat. 5, 28(1976), 625-632. (in Romanian)
77] I. Tomescu[To76b]. On the number of negative cycles of a complete signed graph, Math. Sci. Humaines 14, 53(1976), 63-67. (in French)
78] I. Tomescu[To76c]. The maximum number of colorings of a Hamiltonian graph, Discrete Mathematics 16(1976), 353-359. (in French)
79] I. Tomescu[To75a]. An algorithm for determining a Hamiltonian path by using the minimum spanning tree of a graph, RAIRO Rech. Opérat. V3,9(1975), 5-12. (in French)
80] I. Tomescu[To74a]. The minimum reduction of a graph to a union of cliques, Discrete Mathematics 10(1974), 173-179. (in French)
81] I. Tomescu[To74b]. A combinatorial algorithm for solving the permanenttype problems, Calcolo 3, 11(1974), 329-339. (in French)
82] I. Tomescu[To73a]. Inequalities concerning uniform hypergraphs, Cah. Centre Et. Rech. Opérat. 3, 15(1973), 355-362. (in French)
83] I. Tomescu[To73b]. Note on a characterisation of graphs having a maximum inbalance degree, Math. Sci. Humaines 42(1973), 37-40. (in French)
84] I. Tomescu[To73c]. A combinatorial algorithm for solving covering problems, IEEE Trans. Computers 2, C-22(1973), 218-220.
85] I. Tomescu[To72a]. The number of labeled k-cyclic connected graphs, Calcolo 1-2, 9(1972), 71-74. (in French)
86] I. Tomescu[To72b]. A matrix method for determining all pairs of compatible states of a sequential machine, IEEE Trans. Computers 5, C-21(1972), 502-503.
87] I. Tomescu[To72c]. The maximum number of 3-colorings of a connected graph, Discrete Mathematics 1, 4(1972), 351-356. (in French)
88] I. Tomescu[To72d]. A characterisation of minimum k-chromatic graphs without isolated vertices, RAIRO R1, 6(1972), 88-91. (in French)
89] I. Tomescu[To72e]. A method for minimizing the number of states for a restricted class of incompletely specified sequential machines, Math. Systems Theory 1, 6(1972), 1-2.
90] I. Tomescu[To72f]. Ordered algebraic structures in the theory of graphs, St. Cerc. Mat. 3, 24(1972), 469-476. (in Romanian)
91] I. Tomescu[To72g]. The minimum number of graph colorings, C. R. Acad. Sci. Paris Ser. I Math. 274(1972), 539-542. (in French)
92] I. Tomescu[To71a]. The maximum number of graph colorings, C. R. Acad. Sci. Paris Ser. I Math. 272(1971), 1301-1303. (in French)
93] I. Tomescu[To71b]. On the number of maximal cliques of a graph and some problems about perfect graphs, Rev. Roumaine Math. Pures Appl. 7, 16(1971), 1115-1126. (in French)
94] I. Tomescu[To71c]. An inequality for the point-arboricity of a graph, An. Stiin. Univ. ”Alex. I. Cuza”, Iasi, Sect. I Mat. (N. S. ) 2, 17(1971), 287-289.
95] I. Tomescu[To71d]. The number of subarborescences of a given arborescence, An. Univ. Bucuresti, Mat. 1, 20(1971), 141-145. (in French)
96] I. Tomescu[To71e]. The number of labeled connected k-chromatic graphs having a minimum number of edges, C. R. Acad. Sci. Paris Ser. I Math. 273(1971), 1124-1126. (in French)
97] I. Tomescu[To70a]. A method for determining the transitive closure of a finite graph. II. The solution of the problem in two steps, An. Stiin. Univ. ”Alex. I. Cuza”, Ia¸si, Sect. I Mat. (N. S. ) 1, 16(1970), 199-203.(in French)
98] I. Tomescu[To70b]. A proof of Dilworth theorem and its application to a problem of graph covering, Calcolo 3-4, 7(1970), 289-294. (in French)
99] I. Tomescu[To70c]. A modified matrix algorithm for determining the complete connection matrix of a switching network, IEEE Trans. Computers 1, C19(1970), 78-79.
100] I. Tomescu[To69a]. An evaluation of the chromatic number of a finite graph, Studia Sci. Math. Hung. 3-4(1969), 55-58. (in French)
101] I. Tomescu[To69b]. On the minimum tests for symmetric Boolean functions, Calcolo 1, 6(1969), 59-68. (in French)
102] I. Tomescu[To69c]. An algorithm for the synthesis of Boolean symmetric functions, St. Cerc. Mat. 4, 21(1969), 675-681. (in Romanian)
103] I. Tomescu[To69d]. An algorithm for determining the chromatic number of a finite graph, Econom. Comput. Econom. Cybernet. Stud. Res. (Bucharest) 1(1969), 69-81.
104] I. Tomescu[To69e]. Recent researches in the theory of Boolean matrices, St. Cercet. Calc. Econ. Ciber. Econ. (Bucharest) 1(1969), 23-33. (in Romanian)
105] I. Tomescu[To68a]. An equivalence theorem of (1-k) multipoles, An. Univ. Bucure¸sti, Mat. 1, 17(1968), 105-107. (in Romanian)
106] I. Tomescu[To68b]. Vertex elimination theorems in the network theory, An. Stiin. Univ. ”Al. I. Cuza”, Ia¸si, Sect. I Mat. (N. S. ) 2, 14(1968), 467-472. (in French)
107] I. Tomescu[To68c]. A method of analysis of contact multipoles, Bull. Math. Soc. Sci. Math. Roumanie (N. S. ) 2, 12(60)(1968), 153-157. (in French)
108] I. Tomescu[To68d]. On B. Roy’s matrix algorithm, RAIRO 7(1968), 87-91. (in French)
109] I. Tomescu[To68e]. On the problem of coloring the generalized graphs, C. R. Acad. Sci. Paris Ser. I Math. 267(1968),250-252. (in French)
110] I. Tomescu[To68f]. On the problem of synthesis of Mealy sequential automata, St. Cerc. Mat. 5, 20(1968), 763-770. (in Romanian)
111] I. Tomescu[To68g]. On the synthesis of Boolean functions by disjunctive networks, St. Cerc. Mat. 2, 20(1968), 267-282. (in Romanian)
112] I. Tomescu[To67a]. An algorithm for determining the shortest distances between vertices of a network, RFIRO 5(1967), 133-139. (in French)
113] I. Tomescu[To67b]. A method for finding the transitive closure of a finite graph, RFIRO 4(1967), 33-37. (in French)
114] I. Tomescu[To67c]. On a problem concerning partitions having a minimum number of classes, C. R. Acad. Sci. Paris Ser. I Math. 265(1967), 645- 648. (in French)
115] I. Tomescu[To67d]. On some combinatorial problems in the classification theory, St. Cerc. Mat. 9, 19(1967), 1385-1393. (in Romanian)
116] I. Tomescu[To67e]. Some properties of the characteristic function of a multipole, St. Cerc. Mat. 6, 19(1967), 927-934. (in Romanian)
117] I. Tomescu[To67f]. On a matrix method which occurs in the theory of nets, St. Cerc. Mat. 1, 19(1967), 105-118. (in Romanian)
118] I. Tomescu[To66a]. On the matrix methods in network theory, C. R. Acad. Sci. Paris Ser. I Math. 263(1966), 826-829. (in French)
119] I. Tomescu[To66b]. A method for the determination of the path of least length between two vertices of a finite graph, An. Univ. Bucuresti, Mat. 2, 15(1966), 91-104. (in Romanian)
120] I. Tomescu[To66c]. On some simplification theorems of contact multipoles, An. Univ. Bucuresti, Mat. 1, 15(1966), 155-160. (in Romanian)
121] I. Tomescu[To65a]. A method for determining the
conductibilities of a multipole, St. Cerc. Mat. 17(1965), 1109-1115. (in Romanian)