SCEAS

The SCEAS System

Title:
Author:

Igor Kríz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Igor Kríz
A class of dimension-skipping graphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1984, v:4, n:4, pp:317-319 [Journal]
Igor Kríz
A cycle-space invariant of the <2-distance-graph in the plane. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1989, v:9, n:1, pp:103-105 [Journal]
Igor Kríz
A hypergraph-free construction of highly chromatic graph without short cycles. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1989, v:9, n:2, pp:227-229 [Journal]
Igor Kríz, Robin Thomas
The menger-like property of the tree-width of infinite graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:86-91 [Journal]
Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz
On Restricted Two-Factors. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1988, v:1, n:4, pp:472-484 [Journal]
Igor Kríz, Robin Thomas
Clique-sums, tree-decompositions and compactness. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:81, n:2, pp:177-185 [Journal]
Igor Kríz, Robin Thomas
Analyzing Nash-Williams' partition theorem by means of ordinal types. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1991, v:95, n:1-3, pp:135-167 [Journal]
Igor Kríz
All trapezoids are Ramsey. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:108, n:1-3, pp:59-62 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP