Search
Search Results
-
Additive Number Theory
One of the most infamous problems is Goldbach’s conjecture that every even number greater than 4 is expressible as the sum of two odd primes....
-
Algorithmic Aspects of Domination in Graphs
Graph theory was founded by Euler [78] in 1736 as a generalization to the solution of the famous problem of the Könisberg bridges. From 1736 to 1936,...
-
An Introduction to Nonstandard Functional Analysis
In the following let V(X) be the full superstructure over an appropriate infinite set X containing ℂ and containing also the normed linear spaces we...
-
On the independent queens covering problem
The minimum number of queens which can be placed on an n × n chessboard so that all other squares are dominated by at least one queen but no queen...
-
Introduction
This is an edited list of articles concerned with the role of graphs in the theory of ordered sets and its applications. The list is not a cumulative...
-
Finite Covering Problems
In this chapter we conduct a survey of the occurrence of finite covering problems in graph theory, operations research, and miscellaneous fields,...
-
Linear operators in spaces with indefinite metric and their applications
The paper contains a survey of papers reviewed in Ref. Zh. Matematika from 1953–1978 on the theory of linear operators in (mainly Hibert) spaces with...