您要查找的是不是：
- complete balanced bipartite graph 完全等二部图
- On 2-Factors with Large Cycles in a Balanced Bipartite Graph 二分图中含大圈的2-因子
- A construting proof on cycles and matchings in balanced bipartite graphs 二分图含圈与对集的一个构造性证明
- A Degree Sum Condition of 2-factors with Large Cycles in Balanced Bipartite Graphs 均衡二分图中含有大圈的2-因子的度和条件
- On the Adjacent Strong Edge Coloring of Joining Graph with Star and Complete Balanced Bipartite Graph 星和完全等二部图联图的邻强边染色
- balanced bipartite graphs 均衡二分图
- balanced bipartite graph 均衡二分图
- Abstract ：Bipartite graph is a special model in the Graph Theory. 摘 要 ：偶图是图论中的一种特殊模型。
- balance bipartite graph 均衡二部图
- If |V(G)| is even, then G is either an elementary bipartite graph or a brick. 如果 |V(G) |为偶数 ;则 G或者是一个基本的二部图 ;或者是一个砖块 .
- Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs. 大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
- Minimum Weight Vertex Covering Set and Maximum Weight Vertex Independent Set in a Bipartite Graph. 二分图的最小点权覆盖集与最大点权独立集。
- Bipartite graphs with P-regular endomorphism monoids are characterized.P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed. 刻划了具有P-正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P-正则性.
- Partition,Subgraph,Degree sum,Maximum degree,Bipartite graph,Vertex-disjoint,Cycles,Paths. 剖分;子图;度和;最大度;二部图;顶点不交;圈;路.
- Abstract： Bipartite graphs with P-regular endomorphism monoids are characterized.P-regularity of the endomorphism monoid of lexicographic product of graphs is discussed. 摘要 ：刻划了具有P-正则自同态幺半群的二分图，讨论了字典序积图的自同态幺半群的P-正则性.
- Inthis method,a bipartite graph structure is used to track potentially intersecting faces. 该方法主要是利用二部图跟踪两个细分曲面中可能相交的面。
- An algorithm for finding all perfect matchings in a given bipartite graph G(X,Y, E) is presented. 本文提出了一种求解这一问题的算法。
- Although the 2-choosable graphs have been fully classified in [2], the 3-choosable graphs have not been classified yet, even if 3-choosable bipartite graphs. 目前,所有2-可选的图在[2]中已给出,但对3-可选的图,即使是对3-可选的二部图的分类仍未完成。
- The gracefulness of graceful bipartite graph joining path was discussed and the same amalgamated product of the graph was also discussed. 文章讨论了优美二部图粘接路所得图的优美性以及这类图的一种混合积的优美性。
- The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints. MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
