M. Zh. Nikoghosyan

most citedSimple Proofs of two Dirac-type Theorems Involving Connectivity

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2009★ 2 cited

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.

math.CO2009

Large cycles in 4-connected graphs

M. Zh. Nikoghosyan, Zh. G. Nikoghosyan

Every 4-connected graph $G$ with minimum degree $δ$ and connectivity $κ$ either contains a cycle of length at least $4 δ - κ - 4$ or every longest cycle in $G$ is a dominating cycle.