Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("NESETRIL J")

Document Type [dt]

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

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 25 of 60

  • Page / 3
Export

Selection :

  • and

ON UNIQUELY COLORABLE GRAPHS WITHOUT SHORT CYCLESNESETRIL J.1973; CAS. PEST. MAT.; CESKOSL.; DA. 1973; VOL. 98; NO 2; PP. 122-125; BIBL. 6 REF.Serial Issue

AMALGAMATION OF GRAPHS AND ITS APPLICATIONSNESETRIL J.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 415-428; BIBL. 22 REF.Conference Paper

REPRESENTATIONS OF GRAPHS BY MEANS OF PRODUCTS AND THEIR COMPLEXITYNESETRIL J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 94-102; BIBL. 13 REF.Conference Paper

Some nonstandard Ramsey like applicationsNESETRIL, J.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 3-15, issn 0304-3975Conference Paper

RAMSEY CLASSES OF SET SYSTEMSNESETRIL J; ROEDL V.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 2; PP. 183-201; BIBL. 9 REF.Article

ON RAMSEY GRAPHS WITHOUT CYCLES OF SHORT ODD LENGTHSNESETRIL J; RODL V.1979; COMMENT. MATH. UNIV. CAROLINAE; CSK; DA. 1979; VOL. 20; NO 3; PP. 565-582; BIBL. 12 REF.Article

A SELECTIVE THEOREM FOR GRAPHS AND HYPERGRAPHSNESETRIL J; RODL V.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 309-311; ABS. FRE; BIBL. 3 REF.Conference Paper

COHOMOMORPHISMS OF GRAPHS AND HYPERGRAPHSHELL P; NESETRIL J.1979; MATH. NACHR.; DDR; DA. 1979; VOL. 87; PP. 53-61; BIBL. 14 REF.Article

ON THE EDGE-SETS OF RIGID AND CORIGID GRAPHSHELL P; NESETRIL J.1979; MATH. NACHR.; DDR; DA. 1979; VOL. 87; PP. 63-69; BIBL. 10 REF.Article

A SHORT PROOF OF THE EXISTENCE OF HIGHLY CHROMATIC HYPERGRAPHS WITHOUT SHORT CYCLESNESETRIL J; RODL V.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 2; PP. 225-227; BIBL. 9 REF.Article

A SIMPLE PROOF OF THE GALVIN-RAMSEY PROPERTY OF THE CLASS OF ALL FINITE GRAPHS AND A DIMENSION OF A GRAPH.NESETRIL J; RODL V.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 1; PP. 49-55; BIBL. 11 REF.Article

PARTITIONS OF VERTICES.NESETRIL J; RODL V.1976; COMMENT. MATH. UNIV. CAROLINAE; CESKOSL.; DA. 1976; VOL. 17; NO 1; PP. 85-95; BIBL. 10 REF.Article

RAMSEY'S CHARACTERIZATION THEOREM FOR CLASSES OF STRUCTURES I.NESETRIL J; RODL V.1976; IN: GRAPHS HYPERGRAPHES BLOCK SYST. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 173-179; BIBL. 10 REF.Conference Paper

ON RAMSEY MINIMAL GRAPHSNESETRIL J; RODL V.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 307-308; ABS. FRE; BIBL. 7 REF.Conference Paper

RAMSEY'S CHARACTERIZATION THEOREM FOR CLASSES OF STRUCTURES. II.NESETRIL J; RODL V.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 181-186; BIBL. 7 REF.Conference Paper

For graphs there are only four types of hereditary Ramsey classesNESETRIL, J.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 2, pp 127-132, issn 0095-8956Article

PARTITION THEORY AND ITS APPLICATIONNESETRIL J; ROEDL V.1979; LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1979; NO 38; PP. 96-156; BIBL. 7 P.Conference Paper

HOMOMORPHISMS OF GRAPHS AND OF THEIR ORIENTATIONS.HELL P; NESETRIL J.1978; MONATSH. MATH.; OESTERR.; DA. 1978; VOL. 85; NO 1; PP. 39-48; BIBL. 7 REF.Article

THE STRUCTURE OF CRITICAL RAMSEY GRAPHSNESETRIL J; RODL V.1978; ACTA MATH. ACAD. SCI. HUNGAR.; HUN; DA. 1978; VOL. 32; NO 3-4; PP. 295-300; BIBL. 9 REF.Article

PARTITIONS OF FINITE RELATIONAL AND SET SYSTEMS.NESETRIL J; RODL V.1977; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 289-312; BIBL. 13 REF.Article

COMPLETE AND PSEUDOCOMPLETE COLOURINGS OF A GRAPH.BOSAK J; NESETRIL J.1976; MATH. SLOV.; TCHECOSL.; DA. 1976; VOL. 26; NO 3; PP. 171-184; ABS. ANGL.; BIBL. 17 REF.Article

ANOTHER PROOF OF THE FOLKMAN-RADO-SANDERS THEOREMNESETRIL J; ROEDL V.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 1; PP. 108-109; BIBL. 4 REF.Article

HIGH CHROMATIC RIGID GRAPHS IIBABAI L; NESETRIL J.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 65; PP. 55-61; BIBL. 19 REF.Article

RAMSEY THEOREM FOR CLASSES OF HYPERGRAPHS WITH FORBIDDEN COMPLETE SUBHYPERGRAPHSNESETRIL J; RODL V.1979; CZECHOSL. MATH. J.; CSK; DA. 1979; VOL. 29; NO 2; PP. 202-218; BIBL. 7 REF.Article

ON A PROBABILISTIC GRAPH-THEORETICAL METHODNESETRIL J; RODL V.1978; PROC. AMER. MATH. SOC.; USA; DA. 1978; VOL. 72; NO 2; PP. 417-421; BIBL. 11 REF.Article

  • Page / 3