Результаты поиска

'''Strong closure of a graph''' --- сильное замыкание графа. The ''' strong closure''' of a graph <math>G</math> is the graph obtained from <math>G</math> by

'''<math>Bondy-Chv\acute{a}tal</math> closure operation''' — ''[[операция замыкания Бонди-Хва� the resulting graph and call it the '''<math>Bondy-Chv\acute{a}tal</math> closure''' of

'''<math>\,k</math>-Closure of a graph''' — ''[[k-Замыкание графа|<math>\,k</math>-За ...math>\,G</math> contains a ''[[Hamiltonian cycle]]''. The <math>\,k</math>-closure of a graph can be computed in <math>{\mathcal O}(n^{3})</math> time in the