5 citations · 13 across the 21 of their papers we have counts for
7 papers · 1 filter
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…
A three-person deterministic graphical game without Nash equilibria
Endre Boros, Vladimir Gurvich, Martin Milanič +2
We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique…
Linear separation of connected dominating sets in graphs
Nina Chiarelli, Martin Milanič
A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets,…
Graphs vertex-partitionable into strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries
A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called loca…
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…
-perfectly orientable -minor-free and outerplanar graphs
Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos +1
A graph is said to be -perfectly orientable if it has an orientation such that for every vertex , the out-neighborhood of in is a clique in . In …