4 citations · 17 across the 31 of their papers we have counts for
31 papers
Large Cycles in Graphs Around Conjectures of Bondy and Jung -- Modifications and Sharpness
Zhora Nikoghosyan
A number of new sufficient conditions for generalized cycles (large cycles including Hamilton and dominating cycles as special cases) in an arbitrary -connected graph $(k=1,2,..…
A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung
Zhora Nikoghosyan
Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which pr…
New Ore-type Conditions for Hamilton Cycles and Spanning Trees with few leaves
Zhora Nikoghosyan
New Ore-type conditions for Hamilton cycles and spanning trees with few leaves are presented.
On Pure Degree Sequence Manipulations Forcing Long Cycles in Graphs
Zhora Nikoghosyan
The well-known Hamiltonian sufficient conditions, proposed by Dirac, Faudree et al., Pósa, Bondy, Chvátal are based on pure degree manipulations without any additional conditions.…
On Dirac's Conjecture
Zh. G. Nikoghosyan
Let be a 2-connected graph, be the length of a longest path in and be the circumference - the length of a longest cycle in . In 1952, Dirac proved that $c>\sqrt{…
Spanning trees in connected graphs with few branch and end vertices
Zhora Nikoghosyan
A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph , let be the minimum degree sum of tw…