EUDML | A quantitative refinement of the closed graph theorem

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “A quantitative refinement of the closed graph theorem”

An upper bound for the minimum degree of a graph

Ladislav Nebeský (1977)

Czechoslovak Mathematical Journal

Similarity:

Multifunctions with convex closed graph

Corneliu Ursescu (1975)

Czechoslovak Mathematical Journal

Similarity:

Journal for the Cultivation of Mathematics. Abstracts

(1958)

Czechoslovak Mathematical Journal

Similarity: