Does a cubic graph with $2n$ vertices admit a minimal cover with $n-1$ vertices?
Minimum covering in cubic graphs
Flávio
- 1
Does a cubic graph with $2n$ vertices admit a minimal cover with $n-1$ vertices?