1.
Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs
笛卡尔乘积图与直接乘积图的限制边连通性
2.
The Binding Number of cartesian product of circuit and comprete bipartite graph
圈与完全偶图的笛卡尔乘积的联结数
3.
On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs
笛卡尔乘积图的超级3-限制边连通性
4.
THE BINDING NUMBER OF CARTESIAN PRODUCT OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
完全图与完全偶图的笛卡尔乘积的联结数
5.
On Adjacent Vertex-distinguishing Total-coloring of Cartesian Product Graphs of Two Paths
路的笛卡尔乘积图的邻点可区别全染色
6.
Decycling Number of Cartesian product of Complete Graph and Tree,Cycle,Complete Graph,Complete Bipartitle Graph
完全图与树、圈、完全图、完全二部图的笛卡尔乘积图的消圈数
7.
A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result.
一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。
8.
In this paper ,we study the crossing numbers of the cartesian product graph.
本文研究一类笛卡尔积图的交叉数。
9.
On the Crossing Numbers of Cartesian Products of 5-vertices Graphs with Stars;
五阶图与星图的笛卡尔积图的交叉数
10.
Crossing Number of Products of Several 6-Vertex Graphs with Star
几个六阶图与星S_n的笛卡尔积交叉数
11.
Crossing Numbers of Cartesian Products of Stars with 5-vertex Graph
一个五阶图与星图的笛卡尔积交叉数
12.
ON HAMILTONIAN PROPERTY AND CONNECTIVITY OF THE CARTESIAN PRODUCT OF INFINITE GRAPHS
无限图的笛卡尔积的哈密顿性和连通性
13.
The Crossing Number of Cartesian Product of P_n with Circulant Graph C(10,2)
循环图C(10,2)与路P_n的笛卡尔积的交叉数
14.
Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs
若干笛卡尔积图的邻点可区别E-全染色
15.
because at Descartes Boarding School,
因为在笛卡尔寄宿学校，
16.
disquisitiones Anticartesianae
《对笛卡尔〈沉思〉的诘难》
17.
Of or relating to the philosophy or methods of Descartes.
笛卡尔的笛卡尔的哲学或方法的或与之相关的
18.
Much effort has been spent on investigating the crossing numbers of complete graphs, complete bipartite graphs and cartesian products graphs.
大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。