Deciding whether a planar graph has a cubic subgraph is NP-complete
暂无分享，去创建一个
Abstract We show that the problem of deciding whether a given planar graph (complete with planar embedding) of degree at most 7 has a cubic subgraph is NP-complete.
[1] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..