1.
In this paper ,we study the crossing numbers of the cartesian product graph.
本文研究一类笛卡尔积图的交叉数。
2.
On the Crossing Numbers of Cartesian Products of 5-vertices Graphs with Stars;
五阶图与星图的笛卡尔积图的交叉数
3.
Crossing Number of Products of Several 6-Vertex Graphs with Star
几个六阶图与星S_n的笛卡尔积交叉数
4.
Crossing Numbers of Cartesian Products of Stars with 5-vertex Graph
一个五阶图与星图的笛卡尔积交叉数
5.
ON HAMILTONIAN PROPERTY AND CONNECTIVITY OF THE CARTESIAN PRODUCT OF INFINITE GRAPHS
无限图的笛卡尔积的哈密顿性和连通性
6.
The Crossing Number of Cartesian Product of P_n with Circulant Graph C(10,2)
循环图C(10,2)与路P_n的笛卡尔积的交叉数
7.
Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs
若干笛卡尔积图的邻点可区别E-全染色
8.
Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs.
大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
9.
The Quantitative Expression of Cartographic Features and the Model of Cartesian Products for Maps
地图要素的定量表示与地图笛卡尔积模型的探讨
10.
The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题
11.
ON INCIDENCE CHROMATIC NUMBER OF P_N×K_M AND K(n,m);
路与完全图的笛卡尔积图和广义图K(n,m)的关联色数
12.
On the Crossing Numbers of the Cartesian Products of Circular Graph and Some Special Graphs with Paths、Stars、Trees and Cycles
关于循环图及一些特殊图与路、星、树和圈的笛卡尔积的交叉数研究
13.
Lower and Upper Orientable Strong Radius and Diameter of Cartesian Product of Paths
路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)
14.
The Binding Number of cartesian product of circuit and comprete bipartite graph
圈与完全偶图的笛卡尔乘积的联结数
15.
On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs
笛卡尔乘积图的超级3-限制边连通性
16.
Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs
笛卡尔乘积图与直接乘积图的限制边连通性
17.
THE BINDING NUMBER OF CARTESIAN PRODUCT OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
完全图与完全偶图的笛卡尔乘积的联结数
18.
On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths
路的笛卡尔乘积图的邻点可区别全染色