| 1. | A graph is bipartite if it does not contain an odd cycle .
一个图是二部图，如果它不包含奇圈。 |
| 2. | Factor - covered and factor - deleted bipartite graphs
二部图的因子覆盖与因子消去 |
| 3. | On the list colorings of the bipartite graphs and euler graphs
关于二部图和欧拉图的列表着色 |
| 4. | A class of degree - maximal non - hamilton balanced bipartite graphs
一类度极大的非哈密尔顿简单平衡二部图 |
| 5. | This graph is not bipartite , since there are many triangles in it
这个图不是二部图，因为里面存在许多三角形。 |
| 6. | A neural networks used to arrange the lines of shipping transport conforming to two paprts graph
一种符合二部图的船舶运输神经网络算法 |
| 7. | In this paper , we study asec of a class r - regular partite for r - regular partite graph
摘要研究了一类正则二部图的邻强边染色，验证了文献[ 1 ]中猜想是正确的。 |
| 8. | It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low - density erasure codes
其中二部图度序列的设计是构造低密度纠删码的最关键问题之一。 |
| 9. | To pancyclic graphs , bondy ( 1971 ) proves a classic theorem that every hamiltonian graph of order n and size exceeding n 2 / 4
关于泛圈图， bondy ( 1971 )证明了下面经典定理：每个边数至少为n ~ 2 / 4的n阶hamiltonian图是泛圈图或完全二部图。 |
| 10. | Comment : a graph is called bipartite if its vertex can be parted into two parts such that every edge connects one vertex in one part and another vertex in another part
说明：如果能够把一个图的顶点分成两部分，使得每个边连接的两个点，都必然分别在两个部分中，那么称这个图为“二部图” 。 |
