circle graph

In this paper, we discuss the enumeration of circle of planar lattice graph with a real length of 2 and a real width of K in the 2 × n Planar lattice graphy, and obtain a general expression of enumeration.

该文讨论了2×n平面格图实长为2，实宽为k的平面格图圈的计数，得到一般的计数表达式f（k）

Correctly Grasping the Way of Breaking Circle with Graph Theory

用图论理论正确掌握破圈法

Solving problem of formula circle dependency by directed graph

用有向图法解决公式循环依赖问题

Finally, the algorithm to build the directed graph of formula circle dependency and the algorithm to solve the problem of formula circle dependency by directed graph are given.

给出了公式依赖关系图的构造算法和用有向图法解决公式循环依赖的算法。

The Reserch on Equivalence Class of Circle Graph Layout with Behavioural Constraints

带性能约束的圆形图元布局等价类研究

On the Equitable Total Chromatic Number of Mycielski Graph of Circle Graph

圈的Mycielski图的均匀全染色

The Extremal Property of the Maximally Saturated Graph D ( n, k) and its Circuit Uniqueness is maximum. Circle of Friends

极大饱和图D（n，k）的极值性质及圈唯一性

A Method of Assembly Variable Design Based on General Circle Graph Tree

基于广义环图树的装配变量设计方法

A method is proposed to search for a suitable blank area in a graph of closed boundary by detecting if a circle is in touch with the closed boundary.

提出一种在封闭图形内，利用检测圆与封闭图形边界是否触碰的方法（简称圆形法），寻找适合的空白区域，适用于在已知图形上填写字符，确定新图形的位置。

Hamilton circle of the given graph is located with the approach to locating the adjacency edge growth transformation which satisfies all the vertex set in the given graph among vertex set.

文中提出了变换的方法来寻找图中的Hamilton圈，即在图的顶点集中寻找满足包含给定图中所有顶点的自归邻接边增长变换的方法来寻找给定图中的Hamilton圈。

Solve the problem of circle path in graph by searching

用遍历方式求解图中是否存在回路问题

How to solve the problem of formula circle dependency by directed graph is discussed. First, the problem of formula circle dependency in the report form system is proposed.

研究了用有向图法解决报表系统中的公式循环依赖问题，提出了报表系统中的公式循环依赖问题；

Necessary condition about the existence of Hamilton circle in a directed graph

有向图存在Hamilton圈的必要条件

The assembly variable design modeling based on the general circle graph tree, and analyzes the technology of layer control and mechanism of solving of constraints in this modeling. It points out that the going through process of top down is the process of solving constraints.

讨论了基于广义环图树的装配变量设计模型；分析了该模型的约束分层控制技术和约束求解机制，指出该模型的自上而下的遍历过程就是约束求解过程；