961
个编辑
更改
→See also
*[[Bipartite dimension]], the minimum number of complete bipartite graphs whose union is the given graph
*[[Bipartite dimension]], the minimum number of complete bipartite graphs whose union is the given graph
* 二分维度，联合给定图的完全二分图最小量
*[[Bipartite double cover]], a way of transforming any graph into a bipartite graph by doubling its vertices
*[[Bipartite double cover]], a way of transforming any graph into a bipartite graph by doubling its vertices
* 二分双重覆盖，一种将任意图转变为二分图的方法。通过双重复制顶点使原图形成两个不相交的副本。
*[[Bipartite hypergraph]], a generalization of bipartiteness to [[hypergraph]]s.
*[[Bipartite hypergraph]], a generalization of bipartiteness to [[hypergraph]]s.
* 二分超图，具有普遍二分性质的超图
*[[Bipartite matroid]], a class of matroids that includes the [[graphic matroid]]s of bipartite graphs
*[[Bipartite matroid]], a class of matroids that includes the [[graphic matroid]]s of bipartite graphs
* 二部拟阵，属于拟阵的一类，包括二分图的图形拟阵
*[[Bipartite network projection]], a weighting technique for compressing information about bipartite networks
*[[Bipartite network projection]], a weighting technique for compressing information about bipartite networks
* 二分图投影，一种用于压缩有关双向网络信息的加权技术
*[[Convex bipartite graph]], a bipartite graph whose vertices can be ordered so that the vertex neighborhoods are contiguous
*[[Convex bipartite graph]], a bipartite graph whose vertices can be ordered so that the vertex neighborhoods are contiguous
* 凸双枝图，二分图的一种，其顶点可以排序使得相邻顶点是连续的
*[[Multipartite graph]], a generalization of bipartite graphs to more than two subsets of vertices
*[[Multipartite graph]], a generalization of bipartite graphs to more than two subsets of vertices
* 多重图，将二分图进行延申到两个以上的顶点子集。
*[[Parity graph]], a generalization of bipartite graphs in which every two [[induced path]]s between the same two points have the same parity
*[[Parity graph]], a generalization of bipartite graphs in which every two [[induced path]]s between the same two points have the same parity
* 奇偶性图，具有二分图特性，同时同一点之间的每两个诱导路径具有相同的奇偶性
*[[Quasi-bipartite graph]], a type of Steiner tree problem instance in which the terminals form an independent set, allowing approximation algorithms that generalize those for bipartite graphs
*[[Quasi-bipartite graph]], a type of Steiner tree problem instance in which the terminals form an independent set, allowing approximation algorithms that generalize those for bipartite graphs
* 准二分图，一种斯坦纳树Steiner tree问题实例，其中的终端形成一个独立的集合，从而允许近似算法将二分图的规范化
*[[Split graph]], a graph in which the vertices can be partitioned into two subsets, one of which is independent and the other of which is a clique
*[[Split graph]], a graph in which the vertices can be partitioned into two subsets, one of which is independent and the other of which is a clique
* 分割图，图中顶点可以分为两个子集，其中一个子集是独立的，另一个成为团。
*[[Zarankiewicz problem]] on the maximum number of edges in a bipartite graph with forbidden subgraphs
*[[Zarankiewicz problem]] on the maximum number of edges in a bipartite graph with forbidden subgraphs
* Zarankiewicz 问题，关于禁止子图二分图的最大边数问题。
==References==
==References==