Bipanpositionable graph: различия между версиями

'''Bipanpositionable graph''' --- бипанпропозицируемый граф.  

A bipartite hamiltonian graph <math>G</math> is '''bipanpropositionable''' if for

any two  different vertices <math>x</math> and <math>y</math> of <math>G</math> and for any integer <math>k</math>

with <math>d_{G}(x,y) \leq k < |V(G)|/2</math> and <math>(k -  D_{G}(x,y))</math>  is  even,

there exists a hamiltonian cycle <math>C</math> of <math>G</math> such that <math>d-{C}(x,y) = k</math>.