On locating cubic subgraphs in bounded-d
โ
Iain A Stewart
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 236 KB
We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.