1·The concept of square-free coloring was introduced in graph theory by Alon in 2002.
无正方形着色的概念由阿龙在2002年引入图论。
2·Crab Graphs, Algorithms, Graph Theory, How is this network flow?
蟹图形、算法、图论这网络流是怎么做的？
3·Maze problem is a classical problem in graph theory and other fields.
迷宫问题是图论等领域中的经典问题。
4·The coloring theory of graphs is one important branch of graph theory.
图的染色理论是图论中的一个重要分支。
5·The algorithm is based on the principle of flow graph theory and set theory.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
6·Graph theory and neural networks are important parts of circuits and systems.
图论和神经网络是电路与系统的重要组成部分。
7·An algorithm based on graph theory for non-rigid shape matching is presented.
提出了一种基于图理论的非刚体形状匹配算法。
8·Maximum genus and upper embeddable are two important conceptions in graph theory.
最大亏格、上可嵌入是图论中的两个重要概念。
9·We deem it suitable to apply fuzzy graph theory to the classification of vegetation.
这说明模糊图论的最大树方法用于植被的分类是合适的。
10·The chromatic theory of graphs is one of the most important branches of Graph Theory.
图的着色理论是图论的重要分支之一，是图论研究中的最活跃的课题之一。