Now showing items 1-6 of 6

    • How to draw combinatorial maps? 

      Zeps, Dainis; Ķikusts, Paulis (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 

      Zeps, Dainis (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 ...
    • ON CYCLE INVARIANT 

      Zeps, Dainis (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 ...
    • On Grinbergs' differential geometry and finite fields 

      Zeps, Dainis (2019-03-27)
      Emanuels Grinbergs, in his youth, during ten years, from 1933 until 1943, wrote three dissertations on one subject, namely, differential geometry [1, 2, 3]. We think that his work in this direction has been neglected for ...
    • Testing 4-critical plane and projective plane multiwheels using Mathematica 

      Zeps, Dainis (2015-10-27)
      In this article we explore 4-critical graphs using Mathematica. We generate graph patterns according [1, D. Zeps. On building 4-critical plane and projective plane multiwheels from odd wheels, arXiv:1202.4862v1]. Using ...
    • Using 2-colorings in the theory of uniquely Hamiltonian graphs 

      Zeps, Dainis; (2019-02)
      We use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractions