5 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…
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 …
1-perfectly orientable graphs and graph products
Tatiana Romina Hartinger, Martin Milanič
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. g…
Partial characterizations of 1-perfectly orientable graphs
Tatiana Romina Hartinger, Martin Milanič
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form…