Communications in Combinatorics and Optimization - Articles List

Volume & Issue: Volume 3, Issue 1, June 2018, Pages 1-91

Roman domination excellent graphs: trees

Pages 1-24

10.22049/cco.2017.25806.1041

Vladimir D. Samodivkin

Product version of reciprocal degree distance of composite graphs

Pages 25-35

10.22049/cco.2017.26018.1067

K Pattabiraman

Total $k$-Rainbow domination numbers in graphs

Pages 37-50

10.22049/cco.2018.25719.1021

Hossein Abdollahzadeh Ahangar; Jafar Amjadi; Nader Jafari Rad; Vladimir D. Samodivkin

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

Pages 51-70

10.22049/cco.2018.25801.1038

Behrouz Kheirfam; Masoumeh Haghighi

Double Roman domination and domatic numbers of graphs

Pages 71-77

10.22049/cco.2018.26125.1078

Lutz Volkmann

Mixed Roman domination and 2-independence in trees

Pages 79-91

10.22049/cco.2018.25964.1062

Nasrin Dehgardi

Communications in Combinatorics and Optimization

Journal Archive

Volume 8 (2023)

Volume 7 (2022)

Volume 6 (2021)

Volume 5 (2020)

Volume 4 (2019)

Volume 3 (2018)

Volume 2 (2017)

Volume 1 (2016)