Search
Now showing items 1-10 of 32
One more geodesic graph
(2013-12-17)
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 ...
Some reflections on the education of computer scientists
(2013-12-17)
This article in Latvian contains some reflections on educational problems
what concerns computer science.
ON CYCLE INVARIANT
(2013-04-23)
Taking the programming paradigm with the cycle invariant as a base notion
there for a ground cycle paradigm, in a more general setting here these
things are considered. Epistemological aspects with reference to Rene
Descartes ...
How to draw combinatorial maps?
(2013-01-31)
In this article we consider the combinatorial map (rendered by permutations)
approach to graphs on surfaces and how between both could be establish some
terminological uniformity in favor of combinatorial maps in the way ...
On building 4-critical plane and projective plane multiwheels from odd wheels
(2013-01-31)
We build unbounded classes of plane and projective plane multiwheels that are 4-critical that are received summing odd wheels
as edge sums modulo two. These classes can be considered as ascending from a single common graph ...
ORNAMENTAL SIGN LANGUAGE IN THE FIRST ORDER TRACERY BELTS
(QuantumDream, Inc., 2013-09-02)
Notes in the graph theory. A manuscript (with flower snark J5)
(2013-12-13)
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 ...
The persistent presence of the dead: recent excavations at the hunter-gatherer cemetery at Zvejnieki
(Antiquity Publications Ltd., 2013)