Given a graph G that is connected, sub-cubic, triangle free and comprised of vertex disjoint odd holes, can I find its MAX IND set in polynomial time?

An odd hole is an odd cycle of length >= 5. Vertex disjoint means that no odd hole shares a vertex with any other odd hole in the graph.

01 January 2017 7,606 0 View