Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GYORI E")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 22 of 22

  • Page / 1

Export

Selection :

  • and

AN N-DIMENSIONAL SEARCH PROBLEM WITH RESTRICTED QUESTIONSGYORI E.1981; COMBINATORICA (BP., 1981); ISSN 0209-9683; HUN; DA. 1981; VOL. 1; NO 4; PP. 377-380; BIBL. 2 REF.Article

VEGTELEN MATROIDOK OESSZEHASONLITASA. = COMPARAISON DE MATROIDES INFINISGYORI E.1975; MAT. LAPOK; HUN; DA. 1975 PUBL. 1978; VOL. 26; NO 3-4; PP. 311-317; BIBL. 4 REF.Article

Covering simply connected regions by rectanglesGYORI, E.Combinatorica (Print). 1985, Vol 5, Num 1, pp 53-55, issn 0209-9683Article

ON THE EDGE NUMBERS OF GRAPHS WITH HADWIGER NUMBER 4 AND 5GYORI E.1982; PERIOD. MATH. HUNG.; ISSN 0031-5303; HUN; DA. 1982; VOL. 13; NO 1; PP. 21-27; BIBL. 4 REF.Article

ON THE STRUCTURES INDUCED BY BIPARTITE GRAPHS AND INFINITE MATROIDS.GYORI E.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 257-261; BIBL. 3 REF.Article

METASTATIC CARCINOMA IN MENINGIOMA.GYORI E.1976; SOUTH. MED. J.; U.S.A.; DA. 1976; VOL. 69; NO 4; PP. 514-517; BIBL. 10 REF.Article

On the number of C5'S in a triangle-free graphGYORI, E.Combinatorica (Print). 1989, Vol 9, Num 1, pp 101-102, issn 0209-9683Article

A THEOREM OF THE TRANVERSAL THEORY FOR MATROIDS OF FINITE CHARACTERGYORI E; MILNER EC.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 3; PP. 235-240; BIBL. 5 REF.Article

On the number of edge disjoint cliques in graphs of given sizeGYORI, E.Combinatorica (Print). 1991, Vol 11, Num 3, pp 231-243, issn 0209-9683Article

A minimax theorem on intervalsGYÖRI, E.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 1-9, issn 0095-8956Article

The number of small semispaces of a finite set of points in the planeALON, N; GYORI, E.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 154-157, issn 0097-3165Article

Average distance in graphs with removed elementsBIENSTOCK, D; GYORI, E.Journal of graph theory. 1988, Vol 12, Num 3, pp 375-390, issn 0364-9024Article

The Cartesian product of a k-extendable and an l-extendable graph is (k+l+1)-extendableGYÖRI, E; PLUMMER, M. D.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 87-96, issn 0012-365XArticle

Every graph is contained in a sparsest possible balanced graphGYORI, E; ROTHSCHILD, B; RUNCINSKI, A et al.Mathematical proceedings of the Cambridge Philosophical Society. 1987, Vol 98, Num 3, pp 397-401, issn 0305-0041Article

Uj lehetosegek az arvaszunyogok (Diptera: Chironomidae) taxonomiai kutatasaban. I. Pasztazo elektronmikroszkopos vizsgalatok = Nouvelles possibilités pour l'étude taxonomique des Chironomidae. I: Recherches en microscopie électronique à balayage = New possibilities for studing the systematics of Chironomidae. I: Use of scanning electron microscopyDEVAI, G; FELSZERFALVI, J; KOVACS, A et al.Állattani közlemények. 1983, Vol 70, Num 1-4, pp 25-31, issn 0002-5658Article

Nearly bipartite graphsGYÖRI, E; NIKIFOROV, V; SCHELP, R. H et al.Discrete mathematics. 2003, Vol 272, Num 2-3, pp 187-196, issn 0012-365X, 10 p.Article

How to make a graph four-connectedGYÖRI, E; JORDAN, T.Mathematical programming. 1999, Vol 84, Num 3, pp 555-563, issn 0025-5610Article

Electrochemical investigation on prostaglandin F derivatives. I: Anodic iodination of prostaglandin F and its methylestherSZEBENYI-GYORI, E; VELIN-PRIKIDANOVICS, A; KOVACS-MINDLER, V et al.Journal of applied electrochemistry. 1988, Vol 18, Num 2, pp 205-210, issn 0021-891XArticle

Electrochemical investigation on prostaglandin F derivatives. II: Cathodic reduction of the iodinated prostaglandin F and its methyl esterSZEBENYI-GYORI, E; VELIN-PRIKIDANOVICS, A; KOVACS-MINDLER, V et al.Journal of applied electrochemistry. 1989, Vol 19, Num 2, pp 207-212, issn 0021-891XArticle

ADJACENT VERTEX DISTINGUISHING EDGE-COLORINGSBALISTER, P. N; GYÖRI, E; LEHEL, J et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 237-250, issn 0895-4801, 14 p.Article

Variety identification by computer visionFELFÖLDI, J; FEKETE, A; GYÖRI, E et al.Acta horticulturae. 2001, pp 341-345, issn 0567-7572, isbn 90-6605-95-40Conference Paper

Connected graphs without long pathsBALISTER, P. N; GYÖRI, E; LEHEL, J et al.Discrete mathematics. 2008, Vol 308, Num 19, pp 4487-4494, issn 0012-365X, 8 p.Conference Paper

  • Page / 1