Leandro M. Zatesko

According to our database, Leandro M. Zatesko authored at least 8 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

The hardness of recognising poorly matchable graphs and the hunting of the <i>d</i>-snark.

Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes, Raphael C. S. Machado, Celina M. H. de Figueiredo

RAIRO Oper. Res., 2024

2022

Compositions, decompositions, and conformability for total coloring on power of cycle graphs.

Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza

Discret. Appl. Math., 2022

Rainbow connectivity and rainbow criticality on graph classes.

Aleffer Rocha, Sheila Morais de Almeida, Leandro M. Zatesko

Discret. Appl. Math., 2022

2020

Edge-colouring graphs with bounded local degree sums.

Leandro M. Zatesko, Alesom Zorzi, Renato Carmo, André Luiz Pires Guedes

Discret. Appl. Math., 2020

2019

The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal.

João Pedro W. Bernardi, Murilo V. G. da Silva, André Luiz Pires Guedes, Leandro M. Zatesko

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

On the chromatic index of join graphs and triangle-free graphs with large maximum degree.

Alesom Zorzi, Leandro M. Zatesko

Discret. Appl. Math., 2018

Upper Bounds for the Total Chromatic Number of Join Graphs and Cobipartite Graphs.

Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

2015

On the chromatic index of cographs and join graphs.

Alex R. Cunha Lima, Georgia Garcia, Leandro M. Zatesko, Sheila Morais de Almeida

Electron. Notes Discret. Math., 2015