Title of article :
On locating cubic subgraphs in bounded-degree connected bipartite graphs
Author/Authors :
Iain A Stewart، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Abstract :
We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
