Pablo Daniel Torres

According to our database1, Pablo Daniel Torres authored at least 17 papers between 2011 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Grundy dominating sequences on X-join product.
Discret. Appl. Math., 2020

2019
Grundy domination and zero forcing in Kneser graphs.
Ars Math. Contemp., 2019

2018
Complexity of <i>k</i>-tuple total and total {<i>k</i>}-dominations for some subclasses of bipartite graphs.
Inf. Process. Lett., 2018

Total dominating sequences in trees, split graphs, and under modular decomposition.
Discret. Optim., 2018

k-tuple colorings of the Cartesian product of graphs.
Discret. Appl. Math., 2018

2017
On the complexity of the labeled domination problem in graphs.
Int. Trans. Oper. Res., 2017

Shifts of the stable Kneser graphs and hom-idempotence.
Eur. J. Comb., 2017

The automorphism group of the <i>s</i>-stable Kneser graphs.
Adv. Appl. Math., 2017

2015
On the complexity of {k}-domination and k-tuple domination in graphs.
Inf. Process. Lett., 2015

Some links between identifying codes and separating, dominating and total dominating sets in graphs.
Electron. Notes Discret. Math., 2015

k-tuple chromatic number of the cartesian product of graphs.
Electron. Notes Discret. Math., 2015

On the Packing Chromatic Number on Hamming Graphs and General Graphs.
CoRR, 2015

2014
The packing coloring problem for lobsters and partner limited graphs.
Discret. Appl. Math., 2014

2013
On the packing chromatic number of hypercubes.
Electron. Notes Discret. Math., 2013

{k}-domination for chordal graphs and related graph classes.
Electron. Notes Discret. Math., 2013

2012
The Packing Coloring Problem for (q, q-4) Graphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Polynomial instances of the Packing Coloring Problem.
Electron. Notes Discret. Math., 2011


  Loading...