José D. Alvarado

Orcid: 0000-0002-8570-2487

According to our database1, José D. Alvarado authored at least 13 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Resilience for loose Hamilton cycles.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

A canonical Ramsey theorem with list constraints in random graphs.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2019
On Adjacent-vertex-distinguishing Total Colourings of Powers of Cycles, Hypercubes and Lattice Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the maximum number of minimum dominating sets in forests.
Discret. Math., 2019

Sandwiches missing two ingredients of order four.
Ann. Oper. Res., 2019

2018
Dominating sets inducing large components in maximal outerplanar graphs.
J. Graph Theory, 2018

2017
Relating 2-rainbow domination to Roman domination.
Discuss. Math. Graph Theory, 2017

2016
Dominating sets inducing large components.
Discret. Math., 2016

Strong equality of Roman and weak Roman domination in trees.
Discret. Appl. Math., 2016

Averaging 2-rainbow domination and Roman domination.
Discret. Appl. Math., 2016

2015
Perfectly relating the domination, total domination, and paired domination numbers of a graph.
Discret. Math., 2015

Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs.
Discret. Appl. Math., 2015


  Loading...