
Computational Complexity of Covering Twovertex Multigraphs with Semiedges
We initiate the study of computational complexity of graph coverings, ak...
read it

Convexity and positivity in partially defined cooperative games
Partially defined cooperative games are a generalisation of classical co...
read it

Acyclic, Star and Injective Colouring: A Complexity Picture for HFree Graphs
A kcolouring c of a graph G is a mapping V(G) to 1,2,... k such that c(...
read it

List homomorphism problems for signed graphs
We consider homomorphisms of signed graphs from a computational perspect...
read it

A relaxed version of Šoltés's problem and cactus graphs
The Wiener index is a graph parameter originating from chemical graph th...
read it

On Extremal Graphs of Weighted Szeged Index
An extension of the wellknown Szeged index was introduced recently, nam...
read it

On convexity and solution concepts in cooperative interval games
Cooperative interval game is a cooperative game in which every coalition...
read it

A note on simultaneous representation problem for interval and circulararc graphs
In this short note, we show two NPcompleteness results regarding the si...
read it

Edgesum distinguishing labeling
In this paper we study edgesum distinguishing labeling, a type of label...
read it

Graphindexed random walks on special classes of graphs
We investigate the paramater of the average range of MLipschitz mapping...
read it

Algorithmic aspects of MLipschitz mappings of graphs
MLipschitz mappings of graphs (or equivalently graphindexed random wal...
read it

Algorithmic aspects of graphindexed random walks
We study three problems regarding the so called graphindexed random wal...
read it

Characterizing subclasses of coverincomparability graphs by forbidden subposets
In this paper we demonstrate that several theorems from Bres and Bres3 d...
read it
Jan Bok
is this you? claim profile