I got this mail
Dear Praveen Sonare,
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 graph
pls give clear question yaar..
On Sun, Mar 8, 2009 at 2:43 AM, Miroslav Balaz wrote:
> can you also provide description of bdhg,cbg or hyperlink to them.
> Is this question hard? I am not graph expert.
>
> 2009/3/7 Monty
>
>
>> the hamiltonian circuit (HC) problem remains NP-complete when
>>
can you also provide description of bdhg,cbg or hyperlink to them.
Is this question hard? I am not graph expert.
2009/3/7 Monty
>
> the hamiltonian circuit (HC) problem remains NP-complete when
> restricted to chordal bipartite graphs (cbg) and becomes polynomial
> when restricted further to bip
