2 citations · 3 across the 13 of their papers we have counts for
4 papers · 1 filter
Graphs with span 1 and shortest optimal walks
Tanja Dravec, Mirjana Mikalački, Andrej Taranenko
A span of a given graph is the maximum distance that two players can keep at all times while visiting all vertices (edges) of and moving according to certain rules, that pr…
Isolation game on graphs
Boštjan Brešar, Tanja Dravec, Daniel P. Johnston +2
Given a graph and a family of graphs , an -isolating set, as introduced by Caro and Hansberg, is any set such that contains no member…
Maker-Breaker domination game critical graphs
Athira Divakaran, Tanja Dravec, Tijo James +2
The Maker-Breaker domination game (MBD game) is a two-player game played on a graph by Dominator and Staller. They alternately select unplayed vertices of . The goal of Domi…
Induced matching vs edge open packing: trees and product graphs
Bostjan Bresar, Tanja Dravec, Jaka Hedzet +1
Given a graph , the maximum size of an induced subgraph of each component of which is a star is called the edge open packing number, , of . Similarly, the m…