3 citations · 7 across the 5 of their papers we have counts for
5 papers
Simple Proofs of two Dirac-type Theorems Involving Connectivity
Karlen Mosesyan, Mher Nikoghosyan, Zhora Nikoghosyan
Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.
A Lower Bound for the Circumference Involving Connectivity
Zh. G. Nikoghosyan
Let be a graph, a longest cycle in and , the lengths of a longest path and a longest cycle in , respectively. Almost all low…
Large cycles in 4-connected graphs
M. Zh. Nikoghosyan, Zh. G. Nikoghosyan
Every 4-connected graph with minimum degree and connectivity either contains a cycle of length at least or every longest cycle in is a dominating cycle.
On the circumference, connectivity and dominating cycles
Zh. G. Nikoghosyan
Every 4-connected graph with minimum degree and connectivity either has a cycle of length at least or has a dominating cycle.
On Longest Cycle of a graph via Structures of
Zh. G. Nikoghosyan
Two sharp lower bounds for the length of a longest cycle of a graph are presented in terms of the lengths of a longest path and a longest cycle of , denoted by $\overl…