Tim Kos

activity

20162019

most citedOn graphs with equal total domination and Grundy total domination number

5 citations · 5 across the 2 of their papers we have counts for

collaborators

Showing 2016 · math.COShow all

4 papers · 2 filters

math.CO2016

Total dominating sequences in trees, split graphs, and under modular decomposition

Boštjan Brešar, Tim Kos, Graciela Nasini +1

A sequence of vertices in a graph $G$ with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…

math.CO2016

On total domination in the Cartesian product of graphs

Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos +1

Ho proved in [A note on the total domination number, Util.Math. 77 (2008) 97--100] that the total domination number of the Cartesian product of any two graphs with no isolated vert…

math.CO2016

$1$ -perfectly orientable $K_{4}$ -minor-free and outerplanar graphs

Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos +1

A graph $G$ is said to be $1$ -perfectly orientable if it has an orientation such that for every vertex $v \in V (G)$ , the out-neighborhood of $v$ in $D$ is a clique in $G$ . In $1982$ …

math.CO2016

Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

Bostjan Bresar, Tanja Gologranc, Tim Kos

A sequence $S = (v_{1}, \dots, v_{k})$ of distinct vertices of a graph $G$ is called a legal sequence if $N [v_{i}] ∖ \cup_{j = 1}^{i - 1} N [v_{j}] \neq = \emptyset$ for any $i$ . The maximum l…

Total dominating sequences in trees, split graphs, and under modular decomposition

On total domination in the Cartesian product of graphs

1-perfectly orientable K4​-minor-free and outerplanar graphs

Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

$1$ -perfectly orientable $K_{4}$ -minor-free and outerplanar graphs