Zh. Nikoghosyan, On maximal cycle of a graph (Russian), DAN Arm. SSR, v. LXXII, No. 2 (1981) 82-87.
R. Häggkvist and G.G. Nicoghossian, A remark on hamiltonian cycles, J. Combin. Theory Ser. B 30 (1981) 118-120.
Zh. Nikoghosyan, Spanning trees on simple 3-polytopes (Russian), Kybernetika, No. 4 (1982) 35-42.
Zh. Nikoghosyan, n-spanning and hypo-n-spanning graphs (Russian), tanulmanyok, No. 135, Budapest (1982) 153-167.
Zh. Nikoghosyan, On maximal cycles of a graph (Russian), Studia Scientiarum Mathematicarum Hungarica 17 (1982) 251-282.
Zh. Nikoghosyan, A sufficient condition for a graph to be hamiltonian (Russian), DAN Arm. SSR, v. LXXVIII, No. 1 (1984) 12-16.
Zh. Nikoghosyan, An hamiltonian sufficient condition of a graph (Russian), Matematicheskie voprosy kibernetiki i vychislitelnoj tekhniki, v. XIV (1985) 34-54.
Zh. Nikoghosyan, On longest cycles in graphs (Russian), DAN Arm. SSR, v. LXXXI, No. 4 (1985) 166-170.
Zh.G. Nikoghosyan, Path-Extensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 19 (1998) 25-31.
Zh,G. Nikoghosyan, Cycle-Extensions and Long Cycles in Graphs, Mathematical Problems of Computer Science 21 (2000) 121-128.
Zh.G. Nikoghosyan, Cycle-Extensions and Long Cycles in k-connected Graphs, Mathematical Problems of Computer Science 21 (2000) 129-155.
Zh.G. Nikoghosyan, Discrete Mathematics (Armenian), Gyumri Information Technologies Center (2007) 334 p.
Zh.G. Nikoghosyan, Dirac-type generalizations concerning large cycles in graphs, Discrete Mathematics 309 (2009) 1925-1930, doi: 10.1016/j.disc.2008.03.011.
M.Zh. Nikoghosyan, Zh.G. Nikoghosyan, Large cycles in 4-connected graphs, Discrete Math. 311 (2011) 302-306. 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) 19-42, ISBN: 978-953-51-0115-4, InTech, Available from: http://www.intechopen.com/books/new-frontiers-in-graph-theory/pure-links-between-graph-invariants-and-large-cycle-structures-
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) 1531-1541. DOI: 10.1007/s00373-012-1209-4.
|