We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
Memory representations of spatial information require the choice of one or more reference systems to specify spatial relations. In two experiments we investigated the role of diffe...
Conventional software engineering tends to focus on a small part of the software life cycle: the design and implementation of a product. The bulk of the lifetime cost is in the ma...
The important role given to domain ontologies for knowledge representation implies increasing need for development and maintenance of them. However, we have a scarcity of tools sup...
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...