5 papers
New Algorithms for Weighted -Domination and Total -Domination Problems in Proper Interval Graphs
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni +2
Given a positive integer , a -dominating set in a graph is a set of vertices such that every vertex not in the set has at least neighbors in the set. A total -domi…
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
Nina Chiarelli, Tatiana R. Hartinger, Matthew Johnson +2
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Trans…
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 …