In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path between every two vertices, is considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of ...

This article in Latvian contains some reflections on educational problems what concerns computer science.

This fragment of manuscripts, written in Latvian, is taken from a hardcover notebook of E.Grinbergs. The date when these notes started 29.7.72 is clearly seen on the first page, on the page 7 the date is 31.8.72, on 10th ...

In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every two vertices, are considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of Petersen. ...

Facsimile of a manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in ...

These manuscripts (in Latvian) contain examples of graphs without Hamiltonian cycles. See the flower snark J5 on the page 13. The date here 1.6.78.

Problems concerning education of mathematics for the students of the Faculty of economics and managements are considered.

The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973.

Facsimile of manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973.