The Hamilton-Waterloo Problem with C4 and Cm Factors. - Ugur Odabasi; Sibel Özkan (CTW, 2015)

The Hamilton-Waterloo Problem with C4 and Cm factors. - Ugur Odabasi; Sibel Özkan (Discret. Math., 2016)

Uniformly Resolvable Cycle Decompositions with Four Different Factors. - Ugur Odabasi; Sibel Özkan (Graphs Comb., 2017)

Energy-fair and flexible bandwidth-based routing in multi-domain green networks. - Ugur Odabasi; Hadi Alizadeh; Didem Gözüpek (IET Commun., 2019)

Factorizations of complete graphs into cycles and 1-factors. - Ugur Odabasi (Contributions Discret. Math., 2020)

Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. - Peter Adams 001; Ryan C. Bunge; Roger B. Eggleton; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Bull. ICA, 2021)

The spectrum problem for the connected cubic graphs of order 10. - Peter Adams 001; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Discuss. Math. Graph Theory, 2021)

The integer-antimagic spectra of Hamiltonian graphs. - Ugur Odabasi; Dan Roberts; Richard M. Low (Electron. J. Graph Theory Appl., 2021)

The λ-Fold Spectrum Problem for the Orientations of the Eight-Cycle. - Safak Durukan-Odabasi; Ugur Odabasi (Symmetry, 2023)

The directed uniform Hamilton-Waterloo Problem involving even cycle sizes. - Fatih Yetgin; Ugur Odabasi; Sibel Özkan (Discuss. Math. Graph Theory, 2025)