The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study homomorphism problems of signed graphs from a computational point of view. A signed graph ( G , Σ ) is a graph G where each edge is given a sign, positive or negative; Σ ⊆ E ( G ) denotes the set of negative edges. Thus, ( G , Σ ) is a 2 -edge-coloured graph with the property that the edge-colours, { + , − } , form a group under multiplication. Central to the study of signed...
An oriented graph G ⃗ is a directed graph without directed cycles of length at most 2 having set of vertices V ( G ⃗ ) and set of arcs A ( G ⃗ ) . To push a vertex of an oriented graph is to reverse the orientation of the arcs incident to that vertex. If G ′ ⃗ can be obtained by pushing a set of vertices of G ⃗ , then we say G ⃗ is in a push relation with...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.