G is a planar graph with n nodes.
What are the complexity of following problems?
1-A: Does G contain an m-cycle? (m-cycle is a simple cycle with m nodes, m< n)
2-B: complexity of counting all m-cycles in G, (Complexity of #A).
3- what is the complexity of A and B if G is an arbitrary given graph?
Pointing to books and papers is also useful...