7 citations · 33 across the 17 of their papers we have counts for
4 papers · 2 filters
Edge-sum distinguishing labeling
Jan Bok, Nikola Jedličková
We study \emph{edge-sum distinguishing labeling}, a type of labeling recently introduced by Tuza in [Zs. Tuza, \textit{Electronic Notes in Discrete Mathematics} 60, (2017), 61-68]…
Graph-indexed random walks on special classes of graphs
Jan Bok
We investigate the paramater of the average range of -Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graph…
Algorithmic aspects of -Lipschitz mappings of graphs
Jan Bok
-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on . For , an \emph{-Lipschitz m…
Characterizing subclasses of cover-incomparability graphs by forbidden subposets
Jan Bok, Jana Maxová
In this paper we continue investigations of cover-incomparability graphs of finite partially ordered sets (see \cite{Bres,Bres2,Bres3,Bres4} and \cite{Max,MaxDH}). We consider in s…