Login / Signup
Graphs whose acyclic graphoidal covering number is one less than its maximum degree.
S. Arumugam
Indra Rajasingh
P. Roushini Leely Pushpam
Published in:
Discret. Math. (2001)
Keyphrases
</>
maximum number
small number
special case
connected graphs
data model
np hard