部图

用8长圈C8最大填充和最小覆盖完全二部图K（m，n）

Maximal Packing and Minimal Covering of the Complete Bipartite Graph K_ ( m , n ) with C_8 ;

多部图λκn（g）的G-设计，G为有1条悬边的4长圈

G-design of complete multipartite graph λ K_n ( g ), where G is the 4-cycle and A stick

二部图上的K（1，m）划分问题

Partition problems of bipartite graphs

p部图的Kirchhoff指标上界

The Upper Bound for Kirchhoff Index of p-partite Graph

完全二部图K（n，n）的循环圈分解及边&平衡指数集

Cyclic Cycle Decompositions of the Complete Bipartite Graph K_ ( n , n ) and the Edge-Balance Index Sets

一类基于二部图的（g，f）-2-覆盖图的研究

Research on a Type of ( g , f ) - 2-Covered Graphs Based on Bipartite Graphs

完全多部图的G-分解，G为有一条对角线的四边形

G - decomposition of complete multipartite graph Kn ( g ) where G is a quadrilateral with one diagonal

完全k部图和一些特殊图的CORDIAL性

On the cordiality of complete k-partite graph and some specific graphs

考虑了二部图上的V-K1，m划分问题。

| V | - K_ ( 1 , m ) partition problems of bipartite graphs were considered .

作为完全图的最优完全二部图分解的推广，引进了完全k一致超图的最优k团分划的新概念；

The optimal k-clique partition of complete k-uniform hypergraphs is introduced as a generalization of the optimal complete bipartite decomposition of complete graphs .

完全三部图K（n-k，n，n）的色性（英文）

On the Chromaticity of the Complete Tripartite Graph K ( n - k , n , n )

作为一个推论，当G和H均为完全r部图时，Graham猜想成立。

As a conclusion , it is obtained that Graham 's conjecture holds if G and H are complete multipartite graphs .

利用卷积公式，得到完全i-部图的计数公式（第二章），进一步研究了有关完全i-部图的组合恒等式，并通过N（（？）

By using of formulas of convolutions , the author obtains the counting formulas and combinatorial identities of complete i-partite graphs ( see Chapter 2 ) .

首先，我们用一个具有二值阵列的二部图G（X，Y，E）来描述多粒度光交叉节点结构。

Firstly , a bipartite graph G ( X , Y , E ) with Boolean array is used to describe three-stage MG-OXC architecture .

p部图的Kirchhoff指标上界这些座标系叫做杆件座标系（或局部座标系）。

The Upper Bound for Kirchhoff Index of p-partite Graph These axes are called member axes ( or local axes ) .

完全4-部图的无符号Laplacian整根

Signless Laplacian integral solution of a complete 4-partite graph

在本文，我们证明了图K（2,3,4）不是唯一3-列表可染的，从而完全刻画了唯一3-列表可染完全多部图。

In this paper , we prove that graph K2,3,4 is not uniquely 3-list colorable , and as a result we completely characterize the uniquely 3-list colorable complete multipartite graphs .

探讨了完全二部图Km1，m2，完全图卡氏积图Km×Kn和完全图并图Km+Kn的表示数。

The complete bipartite graph Km 1 , m2 , product Km × Kn and sum Km + Kn are discussed here .

本文给出了完全二部图Km，n的P2k+1&因子分解存在的必要条件，同时论证了充分条件的二种特殊情况。

In this paper , the necessary condition for the existence of a P2k + 1 & factorization of Km , n is given . Two cases of sufficient conditions are discussed .

对二部图而言，完全匹配必为最大匹配，且具有完全匹配的二部图必须满足V1与V2中顶点个数相同，采用回溯的递归算法，可求出二部图的所有完全匹配。

This paper give the recursive algorithm for tracing back . It can find out the all complete matching of a bipartite graph .

关于Bowtie的多部图设计

Design of complete multipartite graph with Bowtie

利用图论的方法研究了图G同其补图-G的Roman控制数，得到了完全图和完全多部图的补图的Ro-man控制数及图G同其补图G-的Roman控制数的关系；

The relation between the Roman domination numbers of graph G and its complement graph was studied . The Roman domination number of the complement of the complete graph and multi-complete graph was obtained .

在对二部图及匹配的概念做了进一步阐述后，使用类C语言描述了如何识别无向图是否二部图及如何在二部图中寻找最大匹配乃至完全匹配的算法。

Behind seting forth Bipartite Graph and Matching , this article describe some algorithm to distinguish Undigraph whether it is Bipartite Graph and how to explore maximal Matching and even complete Matching in the Bipartite Graph which has better worth on application of computer by language of similar C.

完全图和完全多部图的Mycielski图的星全染色

On the star total chromatic number of Mycielski 's graphs of complete graphs and complete-partite graphs

本文完全确定了σ（K1,1,3，n）之值，其中Kr，s，t是r×s×t完全三部图。

In this paper , we completely determine the value of σ ( K1,1,3 , n ), where Kr , s , t is the r x s x t complete 3-partite graph .

讨论了完全二部图的因子分解，并给出了4Km，n存在K1,4-因子分解的充分条件。

In this paper , the factorization of a bipartite multigraph is investigated , and a sufficient condition for 4 K m , n to have a K_ ( 1,4 ) factorization is presented .

本文将Hoffman的结果从多重完全图推广到多重多部图，证明了λKn（t）的（K4-e，λ）&分解存在的充分必要条件。

It is proved that the necessary conditions for the existence of decomposition of λ K n ( t ) into K 4 - e are also sufficient . In this paper , the results of Hoffman are extended from complete multi-graph to complete multipartite multi-graph .

完全多部图的M（5）性质

On property M ( 5 ) of some complete multipartite graphs

基于时间序列与多部图的演化聚类动态分析

Morphing Cluster Dynamics Analysis Based on Time Series and Multipartite Graph

二部图在排课系统设计中的应用

Application of the bipartite graph to the design of arranging-lessons system