MTA SZTAKIEU Centre of Excellence in Information Technology and AutomationMTA SZTAKI is a member of ERCIM - the European Research Consortium for Informatics and MathematicsMTA SZTAKI is a member of W3C - the World Wide Web ConsortiumISO 9001 Quality Management




NewsServicesThe InstituteContactIntrawebContentsSearchMagyarul


 
Laboratory of Mathematical Physics and Combinatorics

Group of Mathematical Physics

149-92
GILDING, B. H. -- KERSNER, R.: Diffusion-convection-reaction, frontieres libres et une equation integrale.
Comptes Rendus Acad. Sci. Paris. Ser. I. 313 : 743-746. (1991)

150-92
HASTINGS, H. M. -- JUHÁSZ, F. -- SCHREIBER, M. A.: Stability of structured random matrices.
Proceedings of the Royal Society of London. B. 249 : 223-225. (1992)

151-92
JUHÁSZ, F.: The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs.
Discrete Mathematics . 96 (1) : 59-63. (1991)

152-92
KERSNER, R. -- NICOLOSI, F.: The nonlinear heat equation with absorption: effects of variable coefficients.
Journal of Mathematical Analysis and Applications. 170 (2) : 551-566. (1992)

153-92
VICSEK, T. -- SOMFAI, E. -- VICSEK, M.: Kinetic roughening with multiplicative noise.
Journal of Physics. A.: Mathematical and General Physics and Random Media. 25 : L763-L768. (1992)

Graphs and Networks Group

154-92
DINITZ, J. H. -- GARNICK, D. K. -- GYÁRFÁS, A.: On the irregularity strength of the m x n grid.
Journal of Graph Theory. 16 (4) : 355-374. (1992)

155-92
FAUDREE, R. J. -- GYÁRFÁS, A. -- SZőNYI, T.: Projective spaces and colorings of K_m x K_n.
In: Sets graphs and numbers. Budapest, 1991.
Amsterdam, North-Holland -- Budapest, Bolyai J. Mat. Társ., 1991. pp. 273-278.
(Colloquia Mathematica Societatis János Bolyai 60.)

156-92
FAUDREE, R. J. -- GYÁRFÁS, A. -- LEHEL, J.: Three-regular path pairable graphs.
Graphs and Combinatorics. 8 (1) : 45-52. (1992).

157-92
FÜREDI, Z. -- GYÁRFÁS, A.: Covering t-element sets by partitions.
European Journal of Combinatorics. 12 (6) : 483-489. (1991)

158-92
GYÁRFÁS, A.: Graphs with k odd cycle lengths.
Discrete Mathematics. 103 (1) : 41-48. (1992)

159-92
GYÁRFÁS, A. -- JACOBSON, M. S. -- KINCH, L. -- LEHEL, J. -- SCHELP, R. H.: Irregularity strength of uniform hypergraphs.
Journal of Combinatorial Mathematics and Computation. 11 : 161-172. (1992)

160-92
GYÁRFÁS A.: Variációk a Ramsey témára.
Matematikai Lapok. 1 (1) : 1-24. (1992)

161-92
KINCH, L. -- LEHEL, J.: The irregularity strength of tP_3.
Discrete Mathematics. 94 (1) : 75-79. (1991)

162-92
LEHEL, J. -- MAFFRAY, F. -- PREISSMANN, M.: Graphs with maximal number of minimum cuts.
LSD -- ARTEMIS. Rapport de recherche RR880-M.
Grenoble, Institut IMAG, 1992, 15 p.

Combinatorial Computer Science Group

163-92
AIGNER, M. -- TRIESCH, E. -- TUZA, Zs.: Irregular assignments and vertex distinguishing edge-colorings of graphs.
In: Combinatorics '90. Gaeta, 1990. (Eds. A Barlotti et al.)
Amsterdam, Elsevier, 1992. pp. 1-9.
(Annals of Discrete Mathematics 52.)

164-92
AISTIE-VIDAL, A. -- DUGAT, V. -- TUZA, Zs.: Construction of non-isomorphic regular tournaments.
In: Combinatorics '90. Gaeta, 1990. (Eds. A Barlotti et al.)
Amsterdam, Elsevier, 1992. pp. 11-23.
(Annals of Discrete Mathematics 52.)

165-92
CSUHAJ-VARJÚ, E. -- DASSOW, J. -- KELEMEN, J.: On cooperating/distributed grammar systems with different styles of acceptance.
International Journal of Computer Mathematics. 42 : 173-183. (1992)

166-92
ERDőS, P. -- GALLAI, T. -- TUZA, Zs.: Covering the cliques of a graph with vertices.
Discrete Mathematics. 108 (1-3) : 279-289. (1992)

167-92
ERDőS, P. -- FÜREDI, Z. -- TUZA, Zs.: Saturated r-uniform hypergraphs.
Discrete Mathematics. 98 (2) : 95-104. (1991)

168-92
ERDőS, P. -- FON-DER-FLASS, D. -- KOSTOCHKA, A. V. -- TUZA, Zs.: Small transversals in uniform hypergraphs.
Siberian Advances in Mathematics. 2 (1) : 82-88. (1992)

169-92
KELEMENOVA, A. -- CSUHAJ-VARJÚ, E.: Grammar systems with very simple components.
In: Grammar systems and colonies II. Computer science preprint CS2-92.
Bratislava, Comenius University, 1992. pp. 49-52.

170-92
KORNAI, A. -- TUZA, Zs.: Narrowness, pathwidth and their application in natural language processing.
Discrete Applied Mathematics. 36 (1) : 87-92. (1992)

171-92
KÖRNER, J. -- SIMONYI, G. -- TUZA, Zs.: Perfect couples of graphs.
Combinatorica. 12 (2) : 179-192. (1992)

172-92
RÖDL, V. -- TUZA, Zs.: Rainbow subgraphs in properly edge-colored graphs.
Random Structures and Algorithms. 3 (2) : 175-182. (1992)

173-92
TRUSZCZYNSKI, M. -- TUZA, Zs.: Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discrete Mathematics.
103 (3) : 301-312. (1992)

174-92
TUZA, Zs.: Asymptotic growth of sparse saturated structures is locally determined.
Discrete Mathematics. 108 (1-3) : 397-402. (1992)

175-92
TUZA, Zs.: Decompositions into subhypergraphs with the König property.
In: Sets graphs and numbers. Budapest, 1991.
Amsterdam, North-Holland -- Budapest, Bolyai J. Mat. Társ., 1991. pp. 705-711.
(Colloquia Mathematica Societatis János Bolyai 60.)

176-92
TUZA, Zs.: Dissections into equilateral triangles.
Elemente der Mathematik. 46 (6) : 153-158. (1991)

177-92
TUZA, Zs.: Graph coloring in linear time.
Journal of Combinatorial Theory. Ser. B. 55 (2) : 236-243. (1992)

178-92
TUZA, Zs.: Graph coloring problems with applications in algebraic logic.
Acta Universitatis Carolinae -- Mathematica et Physica. 32 (2) : 55-60. (1991)

179-92
TUZA, Zs.: Large partial parallel classes in Steiner systems.
In: Combinatorics '90. Gaeta, 1990. (Eds. A Barlotti et al.)
Amsterdam, Elsevier, 1992. pp. 545-548.
(Annals of Discrete Mathematics 52.)

180-92
TUZA, Zs. -- LINDENMAYER, A.: Locally generated colourings of hexagonal cell division patterns: application to retinal cell differentiation.
In: Lindenmayer systems impacts on theoretical computer science, computer graphics and developmental biology. (Eds. G. Rozenberg,
A. Salomaa.)
Berlin, Springer, 1992. pp. 333-350.


 
 

wwwold.sztaki.hu
copyright (c) 2000 mta sztakiwebmaster