the hamiltonian circuit (HC) problem remains NP-complete when restricted to chordal bipartite graphs (cbg) and becomes polynomial when restricted further to bipartite distance hereditary graphs (bdhg). I'm not aware of any "well established" class of graphs between bdhg and cbg. If there is one, you could consider the computational complexity of HC when restricted to this class. Do you have any such class of graphs in mind?
anybody having any idea??? please help me..... --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
