Canan Çiftçi

Orcid: 0000-0001-5397-0367

According to our database1, Canan Çiftçi authored at least 6 papers between 2018 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Structure and substructure connectivity of folded divide-and-swap cube.
J. Supercomput., March, 2025

Np-completeness and bounds for disjunctive total domination subdivision.
J. Comb. Optim., January, 2025

2023
Disjunctive Total Domination In Harary Graphs.
Comput. J., December, 2023

2021
Complexity and bounds for disjunctive total bondage.
Theor. Comput. Sci., 2021

2020
Disjunctive Total Domination Subdivision Number of Graphs.
Fundam. Informaticae, 2020

2018
Exponential Independence Number of Some Graphs.
Int. J. Found. Comput. Sci., 2018


  Loading...