SCImago Journal & Country Rank

 


Journal Metrics


2024 JCR Impact Factor: 0.8
2024 CiteScore: 2.6
2024 Source Normalized Impact per Paper (SNIP): 1.551
2024 SCImago Journal Rank (SJR): 0.730

The Communications in Combinatorics and Optimization (CCO) is a peer-reviewed journal having four issues annually. The journal is devoted to advancing and promoting the theory and applications of combinatorics and optimization and interdisciplinary. It is aimed to publish original high quality refereed papers, occasionally survey articles and short notes. There are no fees for submitting, processing or publishing an article in Communications in Combinatorics and Optimization From the beginning of 2023, four issues will be published each year at the end of March, June, September, and December

 

 

 
CCO is a member of  
 
 

  All submissions to CCO are checked by the iThenticate plagiarism software checker before being processed for peer review. 

 

Current Issue: Volume 11, Issue 1, March 2026, Pages 1-306 

Some properties of star-perfect graphs

Pages 49-56

10.22049/cco.2023.28076.1484

Sanghita Ghosh; Ravindra Gundgurti; Abraham Vettiyankal


2-rainbow domination number of the subdivision of graphs

Pages 79-91

10.22049/cco.2024.28850.1749

‎Rostam Yarke Salkhori; Ebrahim Vatandoost; Ali Behtoei


Hypergraphs defined on algebraic structures

Pages 131-144

10.22049/cco.2024.29607.2077

Peter J. Cameron; Aparna Lakshmanan S; Midhuna V. Ajith


Edge corona product and its topological descriptors with applications in complex molecular structures

Pages 189-203

10.22049/cco.2024.29326.1943

Muhammad Faisal Bashir; Muhammad Kamran Jamil; Muhammad Waheed; Aisha Javed; Ismail Naci Cangul


Remarks on the bounds of graph energy

Pages 211-226

10.22049/cco.2024.28825.1739

Ş. Burcu Bozkurt Altındağ; Emina Milovanović; Marjan Matejić; Igor Milovanović


On cozero divisor graphs of ring Zn

Pages 227-245

10.22049/cco.2024.26112.1974

Zahid Raza; Bilal Ahmad Rather; Modjtaba Ghorbani


Total double Roman domination stability in graphs

Pages 247-258

10.22049/cco.2025.30402.2453

Ziqiang Xu; Saeed Kosari; Mina Esmaeili; Aysha Khan; Lutz Volkmann