The Vertex Cover Problem on Cubic Bridgeless Graphs is NP-complete and also in P

 (kunalrelia.github.io)

1 points | by theanonymousone 7 hours ago ago

No comments yet.