5 citations · 8 across the 27 of their papers we have counts for
5 papers · 2 filters
Builder-Blocker General Position Games
Sandi Klavžar, Jing Tian, James Tuite
This paper considers a game version of the general position problem in which a general position set is built through adversarial play. Two players in a graph, Builder and Blocker,…
On large regular (1,1,k)-mixed graphs
C. Dalfó, G. Erskine, G. Exoo +4
An -mixed graph has every vertex with undirected degree , directed in- and out-degree , and diameter . In this paper, we study the case , proposing som…
Lower General Position Sets in Graphs
Gabriele Di Stefano, Sandi Klavžar, Aditi Krishnakumar +2
A subset of vertices of a graph is a \emph{general position set} if no shortest path in contains three or more vertices of . In this paper, we generalise a problem o…
Mutually avoiding Eulerian circuits
Grahame Erskine, Terry Griggs, Robert Lewis +1
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which…
The maximum Wiener index of a uniform hypergraph
Stijn Cambie, Ervin Győri, Nika Salia +2
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected -vertex…