Zh. Nikoghosyan, On maximal cycle of a graph (Russian), DAN Arm. SSR, v. LXXII, No. 2 (1981) 8287.
R. Häggkvist and G.G. Nicoghossian, A remark on hamiltonian cycles, J. Combin. Theory Ser. B 30 (1981) 118120.
Zh. Nikoghosyan, Spanning trees on simple 3polytopes (Russian), Kybernetika, No. 4 (1982) 3542.
Zh. Nikoghosyan, nspanning and hyponspanning graphs (Russian), tanulmanyok, No. 135, Budapest (1982) 153167.
Zh. Nikoghosyan, On maximal cycles of a graph (Russian), Studia Scientiarum Mathematicarum Hungarica 17 (1982) 251282.
Zh. Nikoghosyan, A sufficient condition for a graph to be hamiltonian (Russian), DAN Arm. SSR, v. LXXVIII, No. 1 (1984) 1216.
Zh. Nikoghosyan, An hamiltonian sufficient condition of a graph (Russian), Matematicheskie voprosy kibernetiki i vychislitelnoj tekhniki, v. XIV (1985) 3454.
Zh. Nikoghosyan, On longest cycles in graphs (Russian), DAN Arm. SSR, v. LXXXI, No. 4 (1985) 166170.
Zh.G. Nikoghosyan, PathExtensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 19 (1998) 2531.
Zh,G. Nikoghosyan, CycleExtensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 21 (2000) 121128.
Zh.G. Nikoghosyan, CycleExtensions and Long Cycles in kconnected Graphs, Mathematical Problems of Computer Science 21 (2000) 129155.
Zh.G. Nikoghosyan, Discrete Mathematics (Armenian), Gyumri Information Technologies Center (2007) 334 p.
Zh.G. Nikoghosyan, Diractype generalizations concerning large cycles in graphs, Discrete Mathematics 309 (2009) 19251930, doi: 10.1016/j.disc.2008.03.011.
M.Zh. Nikoghosyan, Zh.G. Nikoghosyan, Large cycles in 4connected graphs, Discrete Math. 311 (2011) 302306. doi:10.1016/j.disc.2010.10.020.
Zh.G. Nikoghosyan, “Graph Invariants and Large Cycles: A Survey”, International Journal of Mathematics and Mathematical Sciences, vol. 2011, Article ID 206404, 11 pages, 2011. doi:10.1155/2011/206404.
Zh.G. Nikoghosyan, Pure Links Between Graph Invariants and Large Cycle Structures, New Frontiers in Graph Theory, Dr. Yagang Zhang (Ed.) (2012) 1942, ISBN: 9789535101154, InTech, Available from: http://www.intechopen.com/books/newfrontiersingraphtheory/purelinksbetweengraphinvariantsandlargecyclestructures
Zh.G. Nikoghosyan, Two Sufficient Conditions for Hamilton and Dominating Cycles, International Journal of Mathematics and Mathematical Sciences, Article in Press, v. 2012, ID 185346, 25p. DOI: 10.1155/2012/185346.
Zh.G. Nikoghosyan, Disconnected forbidden subgraphs, toughness and Hamilton cycles, ISRN Combinatorics, Volume 2013, Article ID 673971, 4 pages, http://dx.doi.org/10.1155/2013/673971.
Zh.G. Nikoghosyan, Advanced Lower Bounds for the Circumference, Graphs and Combinatorics 29 (2013) 15311541. DOI: 10.1007/s0037301212094.
