Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic NumberS. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam. arscom, 72, 2004. Graphoidal Length and Graphoidal Covering Number of a GraphPurnima Gupta, Rajesh Singh, S. Arumugam. ictcsdm 2017: 305-311 [doi]
The following publications are possibly variants of this publication: