Seol an Taifead seo mar Ríomhphost: Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets