Graphs whose acyclic graphoidal covering number is one less than its maximum degree

S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam. Graphs whose acyclic graphoidal covering number is one less than its maximum degree. Discrete Mathematics, 240(1-3):231-237, 2001. [doi]

Abstract

Abstract is missing.