2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2019
A relaxed version of Šoltés's problem and cactus graphs
Jan Bok, Nikola Jedličková, Jana Maxová
The \emph{Wiener index} is one of the most widely studied parameters in chemical graph theory. It is defined as the sum of the lengths of the shortest paths between all unordered p…
math.CO2018★ 2 cited
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…