Diana Sasaki

Orcid: 0000-0002-0514-9918

According to our database1, Diana Sasaki authored at least 33 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the total chromatic number of the direct product of cycles and complete graphs.
RAIRO Oper. Res., 2024

Pebbling in Kneser Graphs.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Results about the total chromatic number and the conformability of some families of circulant graphs.
Discret. Appl. Math., December, 2023

On total coloring and equitable total coloring of infinite snark families.
RAIRO Oper. Res., September, 2023

On the conformability of regular line graphs.
RAIRO Oper. Res., September, 2023

On total coloring the direct product of cycles and bipartite direct product of graphs.
Discret. Math., June, 2023

New results on Type 2 snarks.
Discuss. Math. Graph Theory, 2023

Kochol superposition of Goldberg with Semi-blowup snarks is Type 1.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
On total and edge coloring some Kneser graphs.
J. Comb. Optim., 2022

Revising Johnson's table for the 21st century.
Discret. Appl. Math., 2022

2021
Determining equitable total chromatic number for infinite classes of complete r-partite graphs.
Discret. Appl. Math., 2021

Most direct product of graphs are Type 1.
CoRR, 2021

On total coloring of 4-regular circulant graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

On equitable total coloring of snarks.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

On total coloring the direct product of complete graphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Neighbour-distinguishing labellings of powers of paths and powers of cycles.
J. Comb. Optim., 2020

2019
Equitable Total Chromatic Number of <i>K</i><sub><i>r</i>×<i>p</i></sub> for <i>p</i> Even.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Equitable total coloring of complete r-partite p-balanced graphs.
Discret. Appl. Math., 2019

2018
The Backbone Packet Radio Network coloring for Time Division Multiple Access link scheduling in Wireless Multihop Networks.
Networks, 2018

2017
On star and biclique edge-colorings.
Int. Trans. Oper. Res., 2017

AVD-edge coloring on powers of paths.
Electron. Notes Discret. Math., 2017

On Type 2 Snarks and Dot Products.
Electron. Notes Discret. Math., 2017

2016
On the total coloring of generalized Petersen graphs.
Discret. Math., 2016

On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.
Discret. Appl. Math., 2016

On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math., 2016

The cost of perfection for matchings in graphs.
Discret. Appl. Math., 2016

2015
The 1, 2-Conjecture for powers of cycles.
Electron. Notes Discret. Math., 2015

Snarks with total chromatic number 5.
Discret. Math. Theor. Comput. Sci., 2015

2014
The hunting of a snark with total chromatic number 5.
Discret. Appl. Math., 2014

2013
Semi blowup and blowup snarks and Berge-Fulkerson Conjecture.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Snarks with Total Chromatic Number 5.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
On Coloring Problems of Snark Families.
Electron. Notes Discret. Math., 2011


  Loading...