您要查找的是不是：
- Abstract ：Bipartite graph is a special model in the Graph Theory. 摘 要 ：偶图是图论中的一种特殊模型。
- 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 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
- A complete bipartite graph is a simple bipartite graph with bipartition. 完全偶图是具有二分类的简单偶图。
- G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G. 称G是偶匹配可扩的，如果G中导出子图是偶图的匹配对都可以扩充为G的完美匹配。
- Number1covert to find the minimum matching matroid of bipartite graph,and number2to search for one matching of permeating musters through bipartite graph. 第一个问题转化为求二部图最小匹配数,第二个问题转化为求二部图中渗透集合每个点的一个匹配。
- Finding all perfect matchings in a given bipartite graph has importantapplications to the global routing and channel ordering for VLSI building block layout. 求给定偶图的所有完备匹配问题在LSI/VLSI的布图设计方面有着重要的应用。
- By use of a result of bipartite graphs in the graph theory " K s,s is 1-factorizable",we concluded that if K m,m has a P 2p -factorization, then K ms,ms has a P 2p -factorization (for any positive integers). 利用图论中关于偶图的一个结论“Ks,s是 1 -可因子分解的”构造出当Km ,m有一个P2p 分解时 ,Kms,ms也有一个P2p分解 (当s是正整数 )。
- In this paper, the algorithm is introduced on using bipartite graph to build mathematical model and to solve division between teachers and classes in the design of arranging lessons system. 介绍在进行排课系统设计时,利用二部图结构构造数学模型、解决教师和班级分组问题的算法。
- In this paper, the algorithm is introduced on using bipartite graph to build mathematical model and to solve division between teachers and classes in the design of arranging-lessons system. 摘要介绍在进行排课系统设计时，利用二部图结构构造数学模型、解决教师和班级分组问题的算法。
- have implication for 对…有启示，对…有借鉴
