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

'''Bichordal bipartite graph''' --- бихордальный двудольный граф.  

A bipartite graph <math>G</math> is defined as '''bichordal''', if any cycle

<math>C_{n}</math>, <math>n > 4</math>, of <math>G</math> has at least two chords.