Results 21 to 22 of about 23 (22)
Some of the next articles are maybe not open access.
Graphs whose acyclic graphoidal covering number is one less than its maximum degree
Discrete Mathematics, 2001S Arumugam
exaly
Graphs whose acyclic graphoidal covering number is one less than its maximum degree
Discrete Mathematics, 2001