3 citations · 5 across the 6 of their papers we have counts for
6 papers
How to draw combinatorial map? From graphs and edges to corner rotations and permutations
Dainis Zeps, Paulis Kikusts
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way…
On building 4-critical plane and projective plane multiwheels from odd wheels
Dainis Zeps
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 consider…
4-critical wheel graphs of higher order
Dainis Zeps
4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.
Combinatorial Maps with Normalized Knot
Dainis Zeps
We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinator…
Free Minor Closed Classes and the Kuratowski theorem
Dainis Zeps
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are con…
Graphs as rotations
Dainis Zeps
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pair…