A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
In recent years, the standards of OGC’s Sensor Web Enablement (SWE) initiative have been applied in a multitude of projects to encapsulate heterogeneous geosensors for web-based...
Arne Broering, Theodor Foerster, Simon Jirka, Cars...
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any ...
Douglas A. Cenzer, S. Ali Dashti, Ferit Toska, Seb...