n chromatic graph是什么意思

网络释义

用法例句

A upper bound on the sum of distances of a vertex and mean distance in the k-chromatic graph of order n are gived in this paper.

研究了n阶k色图中平均距离与色数的关系。

On Hamilton Circle Decomposition of Cayley Graphs of Order 2~n and 2p~2

2~n和2p~2阶群上Cayley图的Hamilton图的分解

Competition number of complete pentapartite graphs K_(n,n,n,n,n) where n≡1,5(mod6)

完全五部图K_(n,n,n,n,n)(n≡1,5(mod6))的竞争数

The competition numbers of complete tetrapartite graphs K_(n,n,n,n) where n is even

完全四部图K_(n,n,n,n)(n为偶数)的竞赛数

The competition numbers of complete tetrapartite graphs K_(n,n,n,n) where n is odd

完全四部图K_(n,n,n,n)(n为奇数)的竞赛数

On k-terminal Cut Problem of (n,n)-graph and 3-terminal Cut Problem of (n,n+1)-graph;

（n，n）图的k-终端割与（n，n+1）图的3-终端割问题研究

Chromatic Uniqueness of Certain 2-Connected (n,n+3)-Graphs;

某些2-连通（n，n+3）-图的色唯一性

The S(n)-factoring Numbet for a Complete Bipartite Graph;

完全二部图的S~((n))={K_i:1≤i≤n}-因子数

On the proof of the directed graph n·_5(n≡0(mod2)) is a graceful graph;

有向图n·_5(n≡0(mod2)的优美性

On Adjacent Vertex-distinguishing Total Coloring of P_m∨S_(n,n)

联图P_m∨S_(n,n)的邻点可区别全染色

The Judgment of Chromaticity of 2-connected (n,n+4)-graphs

两类2连通的(n,n+4)图的色性的判定

4-regular Simple Graph of Order n not Necessarily Contains 3-regular Subgraph of Order n;

n阶4正则简单图不一定含n阶3正则子图

The sufficient and necessary condition for C′_(m,n) graph(a derivation of Hamilton Critical graph C_(m,n)) to exist in Hamilton Cycle

Hamilton临界图C_(m,n)的派生图类C′_(m,n)的简单性质

A diagram of complete bipartite graph(infinite graph of n≥6);

完全二部图(n≥6的无限图)的线图

Chromatic Equivalence and Uniqueness of Certain 2-Connected (n, n+2)-Graphs;

某些2-连通（n，n+2）-图的色等价与色唯一性

The Graphs with the Same Chromatic Partitions as the Complement of T(1,1,n);

与T(1,1,n)的补图有相同色划分的图

The Arithmetic Property of the Union of Two Complete Bipartite Graphs K_(m,n) and K_(p,q);

图K_(m,n)∪K_(p,q)的算术性

Adjoint Equivalence Classes of lP_2 ∪T(1,1,n);

lP_2∪T(1,1,n)的伴随等价图类

Bipartite Ramsey Number of {C_4,C_6} vs. K_(1,n);

图{C_4,C_6}对K_(1,n)的二部Ramsey数