Communications in Combinatorics and Optimization : Impact Factor & More
eISSN: 2538-2136pISSN: 2538-2128
Open AccessShare this on:
Key Metrics
CiteScore 
2.5
H-Index
9
SJR
Q1Control and Optimization
SNIP
1.61
Recommended pre-submission checks
Powered by 
Run standard language and technical checks to improve your manuscript – before you submit
Technical Compliance
Ensure manuscript complies with standard submission guidelines.
Language Quality
Improve clarity, grammar, and academic writing style.
A comprehensive report covering all these checks awaits you.
Communications in Combinatorics and Optimization Journal Specifications
| Overview | |
| Publisher | AZARBAIJAN SHAHID MADANI UNIV |
| Language | English |
| Frequency | Semi-annual |
| Publication Time | 20 |
| Editorial Review Process | Anonymous peer review |
| General Details | |
| Publication Details | |
| Editorial Review Detail | |
| Information for authors |
View less
Looking for the right journals to submit your mansucript?
Upload your manuscript and get a submission readiness score and other journal recommendations.
Check my PaperRecently Published Papers in Communications in Combinatorics and Optimization
Two upper bounds on the A_α-spectral radius of a connected graph
- 1 Jun 2022
- Communications in Combinatorics and Optimization
Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
A note on δ^(k)-colouring of the Cartesian product of some graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
On the powers of signed graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
On the 2-independence subdivision number of graphs
- 1 Jun 2022
- Communications in combinatorics and optimization
A counterexample to a conjecture of Jafari Rad and Volkmann
- 1 Jun 2022
- Communications in Combinatorics and Optimization
Two upper bounds on the A_α-spectral radius of a connected graph
- 1 Jun 2022
- Communications in Combinatorics and Optimization
Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
A note on δ^(k)-colouring of the Cartesian product of some graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
On the powers of signed graphs
- 1 Jun 2022
- Communications in Combinatorics and Optimization
On the 2-independence subdivision number of graphs
- 1 Jun 2022
- Communications in combinatorics and optimization
A counterexample to a conjecture of Jafari Rad and Volkmann
- 1 Jun 2022
- Communications in Combinatorics and Optimization
FAQs on Communications in Combinatorics and Optimization
What is the publishing frequency of Communications in Combinatorics and Optimization? 
How many articles did Communications in Combinatorics and Optimization publish last year?
What is the eISSN & pISSN for Communications in Combinatorics and Optimization?
What is Citescore for Communications in Combinatorics and Optimization?
What is the H Index for Communications in Combinatorics and Optimization ?
What is SNIP score for Communications in Combinatorics and Optimization?
What is the SJR for Communications in Combinatorics and Optimization?
Who is the publisher of Communications in Combinatorics and Optimization?
